171
click to vote
COCO
15 years 10 months ago
2005 Springer 
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
143
click to vote
COCO
15 years 10 months ago
2005 Springer 
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
158
click to vote
COCO
15 years 10 months ago
2005 Springer
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
126
click to vote
COCO
15 years 10 months ago
2005 Springer 
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
128
click to vote
COCO
15 years 6 months ago
2005 Springer 
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
|
Algorithms