6 search results - page 1 / 2 » Derandomizing Arthur-Merlin Games Using Hitting Sets |
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
STOC
2007
ACM
14 years 5 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
ECCC
2000
13 years 4 months ago
2000
Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...
APPROX
2007
Springer
13 years 8 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...