Separations by random oracles and “almost” classes for generalized reducibilities

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 969, Issue , 1995, Pages 179-190

  Merkle, Wolfgang ^a   Wang, Yongge ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBABILITY;

BINARY RELATION; CONTINUOUS FUNCTIONALS; COUNTABLE SET; KOLMOGOROV; MACHINE MODELING; RANDOM ORACLE; RESOURCE-BOUNDED; TOURING MACHINES;

TURING MACHINES;

EID: 84947936815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60246-1_124     Document Type: Conference Paper

References (8)

1. K. Ambos-Spies. Randomness, relativizations, and polynomial reducibilities. Proc. First Structure in Complexity Theory Conference, Lecture Notes in Computer Science Vol. 223, Springer Verlag, Heidelberg New York, 1986, 23-34.
2. K. Ambos-Spies. Randomness, relativizations, and polynomial reducibilities. Unpublished research paper, 1986.
3. J.L. Balcázar, J. Díaz, J. Gabarró. Structural Complexity I and II. Springer Verlag, Heidelberg New York, 1988 and 1990.
4. C.H. Bennett, J. Gill. Relative to a random oracle A, pA ≠ s NpA ≠ s co - NP A with probability 1. SIAM Journal on Computing 10 (1981), 96-113.
5. R.V. Book, J.H. Lutz, D.M. Martin Jr. The global power of additional queries to random oracles. Symposium on Theoretical Aspects of Computer Science 1994, Lecture Notes in Computer Science 775, Springer Verlag, Heidelberg New York, 1994, 403-414.
6. R.V. Book, J.H. Lutz, K.W. Wagner. An observation on probability versus randomness with applications to complexity classes. Mathematical Systems Theory 27 (1994), 201-209.
7. R.V. Book, S. Tang. Polynomial-time reducibilities and almost all oracle sets. Theoretical Computer Science 81 (1991), 35-47.
8. P. Odifreddi. Classical Recursion Theory. North Holland, Amsterdam, 1989.