139
click to vote
COCO
15 years 5 months ago
2010 Springer 
—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symm...
143
click to vote
COCO
15 years 5 months ago
2010 Springer 
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
135
click to vote
COCO
15 years 4 months ago
2010 Springer 
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
133
click to vote
COCO
15 years 5 months ago
2010 Springer 
We prove that weighted monotone/antimonotone circuit satisfiability has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT...
128
click to vote
COCO
15 years 2 months ago
2010 Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
|
Algorithms