4 search results - page 1 / 1 » Lower Bounds for Swapping Arthur and Merlin |
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 )...
ECCC
2010
12 years 11 months ago
2010
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...