An oracle builder's toolkit

Information and Computation

Volumn 182, Issue 2, 2003, Pages 95-136

  Fenner, Stephen ^a,b,c   Fortnow, Lance ^a,d   Kurtz, Stuart A ^a   Li, Lide ^a  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b University of South Carolina   (United States)

^c UNIVERSITY OF SOUTHERN MAINE   (United States)

^d NEC LABORATORIES AMERICA   (United States)

Author keywords

Complexity classes; Forcing; Generic oracles; Genericity; Relativization

Indexed keywords

COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

COMPLEXITY CLASSES;

COMPUTER SOFTWARE;

EID: 0037621528     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00018-X     Document Type: Article

References (56)

1. V. Arvind, P.P. Kurur, Graph Isomorphism is in SPP, in: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, IEEE, New York, 2002, pp. 743-750.
2. K. Ambos-Spies, Resource-bounded genericity, in: S.B. Cooper, T.A. Slaman, S.S. Wainer (Eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory, Cambridge University Press, Cambridge, 1996, pp. 1-59.
3. C.H. Bennett, E. Bernstein, G. Brassard, U. Vazirani, Strengths and weaknesses of quantum computation, SIAM J. Comput. 26 (5) (1997) 1510-1523, quant-ph/9701001.
4. R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf, Quantum lower bounds by polynomials, in: Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, IEEE, New York, 1998, pp. 352-353, quant-ph/9802049.
5. R. Beigel, H. Buhrman, L. Fortnow, NP might not be as easy as detecting unique solutions, in: Proceedings of the 30th ACM Symposium on the Theory of Computing, ACM, New York, 1998, pp. 203-208.
6. J.L. Balcázar, J. Díaz, J. Gabarró, Structural Complexity I, EATCS Monographs on Theoretical Computer Science, vol. 11, Springer-Verlag, Berlin, 1988.
7. J.L. Balcázar, J. Díaz, J. Gabarró, Structural Complexity II, EATCS Monographs on Theoretical Computer Science, vol. 22, Springer-Verlag, Berlin, 1990.
8. H. Buhrman, L. Fortnow, Two queries, J. Comput. Syst. Sci. 59 (2) (1999) 182-194.
9. 4 with probability 1, SIAM J. Comput. 10 (1981) 96-113.
10. L. Berman, J. Hartmanis, On isomorphism and density of NP and other complete sets, SIAM J. Comput. 1 (1977) 305-322.
11. M. Blum, R. Impagliazzo, Generic oracles and oracle classes, in: Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, IEEE, New York, 1987, pp. 188-196.
12. M. Böttcher, Private communication, 1993.
13. E. Bernstein, U. Vazirani, Quantum complexity theory, SIAM J. Comput. 26 (5) (1997) 1411-1473.
14. P.J. Cohen, The independence of the continuum hypothesis, I, in: Proceedings of the National Academy of Science, vol. 50, 1963, pp. 1143-1148.
15. P.J. Cohen, The independence of the continuum hypothesis, II, in: Proceedings of the National Academy of Science, vol. 51, 1964, pp. 105-110.
16. S. Feferman, Some applications of the notions of forcing and generic sets, Fundam. Math. 56 (1965) 325-345.
17. S.A. Fenner, Counting complexity and quantum computation, in: R.K. Brylinski, G. Chen (Eds.), Mathematics of Quantum Computation, CRC Press, Boca Raton, 2002, pp. 171-219 (Chapter 8).
18. S.A. Fenner, PP-lowness and a simple definition of AWPP, Theory of Computing Systems 36 (2003) 199-212. Also available as ECCC Report TR02-036.
19. S. Fenner, L. Fortnow, S. Kurtz, Gap-definable counting classes, J. Comput. Syst. Sci, 48 (1) (1994) 116-148.
20. S.A. Fenner, L.J. Fortnow, S.A. Kurtz, The isomorphism conjecture holds relative to an oracle, SIAM J. Comput. 25 (1) (1996) 193-206.
21. S. Fenner, L. Fortnow, S. Kurtz, L. Li, An oracle builder's toolkit, in: Proceedings of the 8th IEEE Structure in Complexity Theory Conference, 1993, pp. 120-131.
22. L. Fortnow, Counting complexity, in: L.A. Hemaspaandra, A.L. Selman (Eds.), Complexity Theory Retrospective II, Springer-Verlag, Berlin, 1997.
23. L. Fortnow, J. Rogers, Separability and one-way functions, in: Proceedings of the 5th Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, vol. 834, Springer-Verlag, Berlin, 1994, pp. 396-404.
24. L. Fortnow, J. Rogers, Complexity limitations on quantum computation, J. Comput. Syst. Sci. 59 (2) (1999) 240-252, cs.CC/9811023.
25. S. Fenner, M. Schaefer, Simplicity and strong reductions. Unpublished manuscript, 1997. Available from 〈http://www.cse.sc.edu/̃fenner/papers/simplicity.ps〉.
26. L. Fortnow, T. Yamakami, Generic separations, J. Comput. Syst. Sci. 52 (1) (1996) 191-197.
27. J. Grollmann, A. Selman, Complexity measures for public-key cryptosystems, SIAM J. Comput. 17 (1988) 309-335.
28. J. Hartmanis, L. Hemachandra, One-way functions and the nonisomorphism of NP-complete sets, Theoret. Comput. Sci. 81 (1) (1991) 155-163.
29. S. Homer, A. Selman, Oracles for structural properties: the isomorphism problem and public-key cryptography, J. Comput. Syst. Sci. 44 (2) (1992) 287-301.
30. R. Impagliazzo, M. Naor, Decision trees and downward closures, in: Proceedings of the 3rd IEEE Structure in Complexity Theory Conference, IEEE, New York, 1988, pp. 29-38.
31. T. Jech, Set Theory, Academic Press, New York, 1978.
32. C.G. Jockusch, Degrees of generic sets, in: F.R. Drake, S.S. Wainer (Eds.), Recursion Theory: Its Generalizations and Applications, Cambridge University Press, Cambridge, 1980, pp. 110-139.
33. S.A. Kurtz, S.R. Mahaney, J.S. Royer, The structure of complete degrees, in: A.L. Selman (Ed.), Complexity Theory Retrospective, Springer-Verlag, Berlin, 1990, pp. 108-146 (Chapter 6).
34. S. Kurtz, S. Mahaney, J. Royer, The isomorphism conjecture fails relative to a random oracle, J. ACM 42 (2) (1995) 401-420.
35. S. Kleene, E. Post, The uppersemilattice of degrees of recursive unsolvability, Ann. Math. 59 (1954) 379-407.
36. J. Köbler, U. Scheming, J. Torán, Graph Isomorphism is low for PP, Comput. Complexity 2 (4) (1992) 301-330.
37. K. Kunen, Set Theory: An Introduction to Independence Proofs, Studies in Logic and the Foundations of Mathematics, vol. 102, North-Holland, Amsterdam, 1980.
38. S. Kurtz, The isomorphism conjecture fails relative to a generic oracle, Technical Report 88-018, Department of Computer Science, University of Chicago, 1988.
39. D. Lacombe. Sur le semi-réseau constitué par les degr̀s d'Indécidabilité ré recursive, Comptes rendus hebdomadaires des séances de l'Académie des Sciences (Paris) 239 (1954) 1108-1109.
40. L. Li, On the counting functions. Technical Report TR-93-12, The University of Chicago, 1993. PhD Thesis. Available from 〈http://www.cs.uchicago.edu/research/publications/techreports/TR-93-12 〉.
41. J.H. Lutz, Almost everywhere high nonuniform complexity, J. Comput. Syst. Sci. 44 (1992) 220-258.
42. M. Li, P. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, Texts and Monographs in Computer Science, Springer-Verlag, Berlin, 1993.
43. K. Mehlhorn, On the size of sets of computable functions, in: Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, IEEE Computer Society, Silver Spring, 1973, pp. 190-199.
44. N. Nisan, M. Szegedy, On the degree of boolean functions as real polynomials, Comput. Complexity 4 (1994) 301-313.
45. P. Odifreddi, Forcing and reducibilities, J. Symbol. Logic 48 (2) (1983) 288-310.
46. P. Odifreddi, in: Classical Recursion Theory, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1989.
47. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
48. J. Rogers, The isomorphism conjecture holds and one-way functions exist relative to an oracle, J. Comput. Syst. Sci. 54 (3) (1997) 412-423.
49. G.E. Sacks, Forcing with perfect closed sets, in: D.S. Scott (Ed.), Axiomatic Set Theory, American Mathematical Society, Providence, 1971, pp. 331-355.
50. U. Schöning, The power of counting, in: A.L. Selman (Ed.), Complexity Theory Retrospective, Springer-Verlag, Berlin, 1990.
51. R.M. Solovay, A model of set theory in which every set of reals is Lebesgue measurable, Ann. Math. 92 (1970) 1-56.
52. C. Spector, On degrees of recursive unsolvability, Ann. Math. 64 (2) (1956) 581-592.
53. T.A. Slaman, W.H. Woodin, Definability in the Turing degrees, Illinois J. Math. 30 (1986) 320-334.
54. T.A. Slaman, W.H. Woodin, Definability in the enumeration degrees, Arch. Math. Logic 36 (1997) 255-267.
55. L. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979) 189-201.
56. A. Yao, Quantum circuit complexity, in: Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 352-361.