Publications associées à BPP (complexité)

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

We give two new randomized algorithms for tight renaming, both of which work against an adaptive adversary. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

BPP (complexité)

Graph Chatbot

Chattez avec Graph Search

Sub-Logarithmic Test-and-Set Against a Weak Adversary

The Complexity of Renaming

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Rank-Deficient Quadratic-Form Maximization Over M-Phase Alphabet: Polynomial-Complexity Solvability And Algorithmic Developments

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

Graph-based classification of multiple observation sets

Mutual information measures for subclass error-correcting output codes classification

Subclass error correcting output codes using fisher's linear discriminant ratio

Collision Attacks against the Knudsen-Preneel Compression Functions

A Randomized Countermeasure Against Parasitic Adversaries in Wireless Sensor Networks

Sub-Logarithmic Test-and-Set Against a Weak Adversary

The Complexity of Renaming

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

Mutual information measures for subclass error-correcting output codes classification

Rank-Deficient Quadratic-Form Maximization Over M-Phase Alphabet: Polynomial-Complexity Solvability And Algorithmic Developments

Graph-based classification of multiple observation sets

Subclass error correcting output codes using fisher's linear discriminant ratio

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

A Randomized Countermeasure Against Parasitic Adversaries in Wireless Sensor Networks

Collision Attacks against the Knudsen-Preneel Compression Functions