2 citations found. Retrieving documents...
Jose Luis Balcazar, Josep Daz, and Joaquim Gabarro. Structural Complexity II. Number 22 in EATCS Monographs on Theoretical Computer Science. Springer, Berlin-Heidelberg-New York, 1990.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Derandomizing Arthur-Merlin Games using Hitting Sets - Miltersen, Variyam (1999)   (16 citations)  (Correct)

....7 tells us that every explicit disperser can be easily converted into a relativizable hitting set generator. 2 Terminology and Preliminary Results Lower case Greek letters denote rational constants between 0 and 1. The symbol log denotes log 2 . Complexity classes We assume standard textbook [BDG90, Pap94] complexity theoretic notation and definitions, such as the definitions of standard complexity classes like P, NP, E, NE, and BPP. Here we only give the definition of the class AM. A language L is defined to be in AM if there is a language L # P and a polynomial p, so that for all ....

Jose Luis Balcazar, Josep Daz, and Joaquim Gabarro. Structural Complexity II. Number 22 in EATCS Monographs on Theoretical Computer Science. Springer, Berlin-Heidelberg-New York, 1990.


Derandomizing Arthur-Merlin Games using Hitting Sets - Miltersen, Vinodchandran (1999)   (16 citations)  (Correct)

....7 tells us that every explicit disperser can be easily converted into a relativizable hitting set generator. 2 Terminology and Preliminary Results Lower case Greek letters denote rational constants between 0 and 1. The symbol log denotes log 2 . Complexity classes We assume standard textbook [BDG90, Pap94] complexity theoretic notation and definitions, such as the definitions of standard complexity classes like P, NP, E, NE, and BPP. Here we only give the definition of the class AM. A language L is defined 2 to be in AM if there is a language L 0 2 P and a polynomial p, so that for all ....

Jose Luis Balcazar, Josep Daz, and Joaquim Gabarro. Structural Complexity II. Number 22 in EATCS Monographs on Theoretical Computer Science. Springer, Berlin-HeidelbergNew York, 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC