106 search results - page 11 / 22 » Probabilistically Checkable Arguments |
106
Voted
FOCS
1991
IEEE
15 years 4 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
140
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
127
click to vote
FOCS
1995
IEEE
15 years 4 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
87
Voted
FCS
2006
15 years 1 months ago
2006
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
103
click to vote
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...