Derandomizing Arthur-Merlin games using hitting sets

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 71-80

  Miltersen, Peter Bro ^a   Vinodchandran, N V ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER CIRCUITS; COMPUTER SIMULATION; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

ARTHUR-MERLIN GAMES; DERANDOMIZATION; HITTING SETS;

COMPUTATIONAL COMPLEXITY;

EID: 0032620477     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)