Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

101

Voted

FOCS
1999
IEEE

90views Theoretical Computer Science» more FOCS 1999»

Derandomizing Arthur-Merlin Games Using Hitting Sets

15 years 7 months ago

Derandomizing Arthur-Merlin Games Using Hitting Sets

Download www.brics.dk

Peter Bro Miltersen, N. V. Vinodchandran

Real-time Traffic

FOCS 1999 | Theoretical Computer Science |

claim paper

Related Content

» Lowend uniform hardness vs randomness tradeoffs for AM

» Simplified derandomization of BPP using a hitting set generator

» Lower Bounds for Swapping Arthur and Merlin

» Derandomization and Distinguishing Complexity

» Efficient Algorithms for Online Game Playing and Universal Portfolio Management

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	FOCS
Authors	Peter Bro Miltersen, N. V. Vinodchandran

Comments (0)