메뉴 건너뛰기




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

An oracle builder's toolkit

Author keywords

Complexity classes; Forcing; Generic oracles; Genericity; Relativization

Indexed keywords

COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

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

References (56)
  • 2
    • 0012720441 scopus 로고    scopus 로고
    • Resource-bounded genericity
    • S.B. Cooper, T.A. Slaman, S.S. Wainer (Eds.), Cambridge University Press, Cambridge
    • 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.
    • (1996) Computability, Enumerability, Unsolvability: Directions in Recursion Theory , pp. 1-59
    • Ambos-Spies, K.1
  • 3
    • 0001063035 scopus 로고    scopus 로고
    • Strengths and weaknesses of quantum computation
    • quant-ph/9701001
    • 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.
    • (1997) SIAM J. Comput. , vol.26 , Issue.5 , pp. 1510-1523
    • Bennett, C.H.1    Bernstein, E.2    Brassard, G.3    Vazirani, U.4
  • 10
    • 0001388818 scopus 로고
    • On isomorphism and density of NP and other complete sets
    • L. Berman, J. Hartmanis, On isomorphism and density of NP and other complete sets, SIAM J. Comput. 1 (1977) 305-322.
    • (1977) SIAM J. Comput. , vol.1 , pp. 305-322
    • Berman, L.1    Hartmanis, J.2
  • 12
    • 85031177717 scopus 로고
    • Private communication
    • M. Böttcher, Private communication, 1993.
    • (1993)
    • Böttcher, M.1
  • 13
    • 5544255325 scopus 로고    scopus 로고
    • Quantum complexity theory
    • E. Bernstein, U. Vazirani, Quantum complexity theory, SIAM J. Comput. 26 (5) (1997) 1411-1473.
    • (1997) SIAM J. Comput. , vol.26 , Issue.5 , pp. 1411-1473
    • Bernstein, E.1    Vazirani, U.2
  • 14
    • 0000762939 scopus 로고
    • The independence of the continuum hypothesis, I
    • P.J. Cohen, The independence of the continuum hypothesis, I, in: Proceedings of the National Academy of Science, vol. 50, 1963, pp. 1143-1148.
    • (1963) Proceedings of the National Academy of Science , vol.50 , pp. 1143-1148
    • Cohen, P.J.1
  • 15
  • 16
    • 0000041150 scopus 로고
    • Some applications of the notions of forcing and generic sets
    • S. Feferman, Some applications of the notions of forcing and generic sets, Fundam. Math. 56 (1965) 325-345.
    • (1965) Fundam. Math. , vol.56 , pp. 325-345
    • Feferman, S.1
  • 17
    • 0037488449 scopus 로고    scopus 로고
    • Counting complexity and quantum computation
    • R.K. Brylinski, G. Chen (Eds.), CRC Press, Boca Raton, (Chapter 8)
    • 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).
    • (2002) Mathematics of Quantum Computation , pp. 171-219
    • Fenner, S.A.1
  • 18
    • 0038269058 scopus 로고    scopus 로고
    • PP-lowness and a simple definition of AWPP
    • Also available as ECCC Report TR02-036
    • 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.
    • (2003) Theory of Computing Systems , vol.36 , pp. 199-212
    • Fenner, S.A.1
  • 20
    • 0029746517 scopus 로고    scopus 로고
    • The isomorphism conjecture holds relative to an oracle
    • 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.
    • (1996) SIAM J. Comput. , vol.25 , Issue.1 , pp. 193-206
    • Fenner, S.A.1    Fortnow, L.J.2    Kurtz, S.A.3
  • 22
    • 0002229646 scopus 로고    scopus 로고
    • Counting complexity
    • L.A. Hemaspaandra, A.L. Selman (Eds.), Springer-Verlag, Berlin
    • L. Fortnow, Counting complexity, in: L.A. Hemaspaandra, A.L. Selman (Eds.), Complexity Theory Retrospective II, Springer-Verlag, Berlin, 1997.
    • (1997) Complexity Theory Retrospective II
    • Fortnow, L.1
  • 23
    • 84957694377 scopus 로고
    • Separability and one-way functions
    • Proceedings of the 5th Annual International Symposium on Algorithms and Computation, Springer-Verlag, Berlin
    • 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.
    • (1994) Lecture Notes in Computer Science , vol.834 , pp. 396-404
    • Fortnow, L.1    Rogers, J.2
  • 24
    • 0032597113 scopus 로고    scopus 로고
    • Complexity limitations on quantum computation
    • cs.CC/9811023
    • L. Fortnow, J. Rogers, Complexity limitations on quantum computation, J. Comput. Syst. Sci. 59 (2) (1999) 240-252, cs.CC/9811023.
    • (1999) J. Comput. Syst. Sci. , vol.59 , Issue.2 , pp. 240-252
    • Fortnow, L.1    Rogers, J.2
  • 27
    • 0023985540 scopus 로고
    • Complexity measures for public-key cryptosystems
    • J. Grollmann, A. Selman, Complexity measures for public-key cryptosystems, SIAM J. Comput. 17 (1988) 309-335.
    • (1988) SIAM J. Comput. , vol.17 , pp. 309-335
    • Grollmann, J.1    Selman, A.2
  • 28
    • 0026138007 scopus 로고
    • One-way functions and the nonisomorphism of NP-complete sets
    • J. Hartmanis, L. Hemachandra, One-way functions and the nonisomorphism of NP-complete sets, Theoret. Comput. Sci. 81 (1) (1991) 155-163.
    • (1991) Theoret. Comput. Sci. , vol.81 , Issue.1 , pp. 155-163
    • Hartmanis, J.1    Hemachandra, L.2
  • 29
    • 0026853226 scopus 로고
    • Oracles for structural properties: The isomorphism problem and public-key cryptography
    • S. Homer, A. Selman, Oracles for structural properties: the isomorphism problem and public-key cryptography, J. Comput. Syst. Sci. 44 (2) (1992) 287-301.
    • (1992) J. Comput. Syst. Sci. , vol.44 , Issue.2 , pp. 287-301
    • Homer, S.1    Selman, A.2
  • 31
    • 0004289448 scopus 로고
    • Academic Press, New York
    • T. Jech, Set Theory, Academic Press, New York, 1978.
    • (1978) Set Theory
    • Jech, T.1
  • 32
    • 0000149604 scopus 로고
    • Degrees of generic sets
    • F.R. Drake, S.S. Wainer (Eds.), Cambridge University Press, Cambridge
    • 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.
    • (1980) Recursion Theory: Its Generalizations and Applications , pp. 110-139
    • Jockusch, C.G.1
  • 33
    • 0008693220 scopus 로고
    • The structure of complete degrees
    • A.L. Selman (Ed.), Springer-Verlag, Berlin. Chapter 6
    • 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).
    • (1990) Complexity Theory Retrospective , pp. 108-146
    • Kurtz, S.A.1    Mahaney, S.R.2    Royer, J.S.3
  • 34
    • 0029272032 scopus 로고
    • The isomorphism conjecture fails relative to a random oracle
    • S. Kurtz, S. Mahaney, J. Royer, The isomorphism conjecture fails relative to a random oracle, J. ACM 42 (2) (1995) 401-420.
    • (1995) J. ACM , vol.42 , Issue.2 , pp. 401-420
    • Kurtz, S.1    Mahaney, S.2    Royer, J.3
  • 35
    • 0001620455 scopus 로고
    • The uppersemilattice of degrees of recursive unsolvability
    • S. Kleene, E. Post, The uppersemilattice of degrees of recursive unsolvability, Ann. Math. 59 (1954) 379-407.
    • (1954) Ann. Math. , vol.59 , pp. 379-407
    • Kleene, S.1    Post, E.2
  • 40
    • 0012378933 scopus 로고
    • Technical Report TR-93-12, The University of Chicago. PhD Thesis
    • 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 〉.
    • (1993) On the Counting Functions
    • Li, L.1
  • 41
    • 0026851355 scopus 로고
    • Almost everywhere high nonuniform complexity
    • J.H. Lutz, Almost everywhere high nonuniform complexity, J. Comput. Syst. Sci. 44 (1992) 220-258.
    • (1992) J. Comput. Syst. Sci. , vol.44 , pp. 220-258
    • Lutz, J.H.1
  • 44
    • 0000607672 scopus 로고
    • On the degree of boolean functions as real polynomials
    • N. Nisan, M. Szegedy, On the degree of boolean functions as real polynomials, Comput. Complexity 4 (1994) 301-313.
    • (1994) Comput. Complexity , vol.4 , pp. 301-313
    • Nisan, N.1    Szegedy, M.2
  • 45
    • 0012668967 scopus 로고
    • Forcing and reducibilities
    • P. Odifreddi, Forcing and reducibilities, J. Symbol. Logic 48 (2) (1983) 288-310.
    • (1983) J. Symbol. Logic , vol.48 , Issue.2 , pp. 288-310
    • Odifreddi, P.1
  • 48
    • 0031165678 scopus 로고    scopus 로고
    • The isomorphism conjecture holds and one-way functions exist relative to an oracle
    • J. Rogers, The isomorphism conjecture holds and one-way functions exist relative to an oracle, J. Comput. Syst. Sci. 54 (3) (1997) 412-423.
    • (1997) J. Comput. Syst. Sci. , vol.54 , Issue.3 , pp. 412-423
    • Rogers, J.1
  • 49
    • 0001229819 scopus 로고
    • Forcing with perfect closed sets
    • D.S. Scott (Ed.), American Mathematical Society, Providence
    • G.E. Sacks, Forcing with perfect closed sets, in: D.S. Scott (Ed.), Axiomatic Set Theory, American Mathematical Society, Providence, 1971, pp. 331-355.
    • (1971) Axiomatic Set Theory , pp. 331-355
    • Sacks, G.E.1
  • 50
    • 4243239867 scopus 로고
    • The power of counting
    • A.L. Selman (Ed.), Springer-Verlag, Berlin
    • U. Schöning, The power of counting, in: A.L. Selman (Ed.), Complexity Theory Retrospective, Springer-Verlag, Berlin, 1990.
    • (1990) Complexity Theory Retrospective
    • Schöning, U.1
  • 51
    • 0002548418 scopus 로고
    • A model of set theory in which every set of reals is Lebesgue measurable
    • R.M. Solovay, A model of set theory in which every set of reals is Lebesgue measurable, Ann. Math. 92 (1970) 1-56.
    • (1970) Ann. Math. , vol.92 , pp. 1-56
    • Solovay, R.M.1
  • 52
    • 0001169015 scopus 로고
    • On degrees of recursive unsolvability
    • C. Spector, On degrees of recursive unsolvability, Ann. Math. 64 (2) (1956) 581-592.
    • (1956) Ann. Math. , vol.64 , Issue.2 , pp. 581-592
    • Spector, C.1
  • 53
    • 84972560728 scopus 로고
    • Definability in the turing degrees
    • T.A. Slaman, W.H. Woodin, Definability in the Turing degrees, Illinois J. Math. 30 (1986) 320-334.
    • (1986) Illinois J. Math. , vol.30 , pp. 320-334
    • Slaman, T.A.1    Woodin, W.H.2
  • 54
    • 0031285143 scopus 로고    scopus 로고
    • Definability in the enumeration degrees
    • T.A. Slaman, W.H. Woodin, Definability in the enumeration degrees, Arch. Math. Logic 36 (1997) 255-267.
    • (1997) Arch. Math. Logic , vol.36 , pp. 255-267
    • Slaman, T.A.1    Woodin, W.H.2
  • 55
    • 49249151236 scopus 로고
    • The complexity of computing the permanent
    • L. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979) 189-201.
    • (1979) Theoret. Comput. Sci. , vol.8 , pp. 189-201
    • Valiant, L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.