메뉴 건너뛰기




Volumn 32, Issue 6, 1999, Pages 625-647

Robust reductions

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES;

EID: 0033432964     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000134     Document Type: Article
Times cited : (4)

References (24)
  • 3
    • 0024874128 scopus 로고
    • On the relativized power of additional accepting paths
    • IEEE Computer Society Press, Los Alamitos, CA, June
    • R. Beigel. On the relativized power of additional accepting paths. In Proceedings of the 4th Structure in Complexity Theory Conference, pages 216-224. IEEE Computer Society Press, Los Alamitos, CA, June 1989.
    • (1989) Proceedings of the 4th Structure in Complexity Theory Conference , pp. 216-224
    • Beigel, R.1
  • 7
    • 0026218974 scopus 로고
    • Strong and robustly strong polynomial time reducibilities to sparse sets
    • R. Gavaldà and J. Balcázar. Strong and robustly strong polynomial time reducibilities to sparse sets. Theoretical Computer Science, 88(1):1-14, 1991.
    • (1991) Theoretical Computer Science , vol.88 , Issue.1 , pp. 1-14
    • Gavaldà, R.1    Balcázar, J.2
  • 8
    • 0000595574 scopus 로고
    • Computational complexity of probabilistic turing machines
    • J. Gill. Computational complexity of probabilistic Turing machines. SIAM Journal on Computing, 6(4):675-695, 1977.
    • (1977) SIAM Journal on Computing , vol.6 , Issue.4 , pp. 675-695
    • Gill, J.1
  • 11
    • 85034272059 scopus 로고
    • Recent directions in algorithmic research
    • Proceedings of the 5th GI Conference on Theoretical Computer Science, Springer-Verlag, Berlin
    • J. Hopcroft. Recent directions in algorithmic research. In Proceedings of the 5th GI Conference on Theoretical Computer Science, pages 123-134. Lecture Notes in Computer Science #104. Springer-Verlag, Berlin, 1981.
    • (1981) Lecture Notes in Computer Science , vol.104 , pp. 123-134
    • Hopcroft, J.1
  • 12
    • 38249025494 scopus 로고
    • NP[log n] and sparse turing-complete sets for NP
    • NP[log n] and sparse Turing-complete sets for NP. Journal of Computer and System Sciences, 39(3):282-298, 1989.
    • (1989) Journal of Computer and System Sciences , vol.39 , Issue.3 , pp. 282-298
    • Kadin, J.1
  • 13
    • 0026205149 scopus 로고
    • Non-uniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes
    • J. Kämper. Non-uniform proof systems: a new framework to describe nonuniform and probabilistic complexity classes. Theoretical Computer Science, 85(2):305-331, 1991.
    • (1991) Theoretical Computer Science , vol.85 , Issue.2 , pp. 305-331
    • Kämper, J.1
  • 14
    • 84944053247 scopus 로고
    • Some connections between nonuniform and uniform complexity classes
    • ACM Press, New York, April
    • R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 302-309. ACM Press, New York, April 1980. An extended version has also appeared as: Turing machines that take advice, L'Enseignement Mathématique, 2nd series, 28: 191-209, 1982.
    • (1980) Proceedings of the 12th ACM Symposium on Theory of Computing , pp. 302-309
    • Karp, R.1    Lipton, R.2
  • 15
    • 0000517449 scopus 로고
    • Turing machines that take advice
    • R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 302-309. ACM Press, New York, April 1980. An extended version has also appeared as: Turing machines that take advice, L'Enseignement Mathématique, 2nd series, 28: 191-209, 1982.
    • (1982) L'Enseignement Mathématique, 2nd Series , vol.28 , pp. 191-209
  • 17
    • 84958052751 scopus 로고
    • New collapse consequences of NP having small circuits
    • Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming, Springer-Verlag, Berlin
    • J. Köbler and O. Watanabe. New collapse consequences of NP having small circuits. In Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming, pages 196-207. Lecture Notes in Computer Science #944. Springer-Verlag, Berlin, 1995.
    • (1995) Lecture Notes in Computer Science , vol.944 , pp. 196-207
    • Köbler, J.1    Watanabe, O.2
  • 18
    • 0002600157 scopus 로고
    • Strong nondeterministic polynomial-time reducibilities
    • T. Long. Strong nondeterministic polynomial-time reducibilities. Theoretical Computer Science, 21:1-25, 1982.
    • (1982) Theoretical Computer Science , vol.21 , pp. 1-25
    • Long, T.1
  • 19
    • 0022756937 scopus 로고
    • Relativizing complexity classes with sparse oracles
    • T. Long and A. Selman. Relativizing complexity classes with sparse oracles. Journal of the ACM, 33(3):618-627, 1986.
    • (1986) Journal of the ACM , vol.33 , Issue.3 , pp. 618-627
    • Long, T.1    Selman, A.2
  • 20
    • 0040156601 scopus 로고
    • Polynomial time enumeration reducibility
    • A. Selman. Polynomial time enumeration reducibility. SIAM Journal on Computing, 7(4):440-457, 1978.
    • (1978) SIAM Journal on Computing , vol.7 , Issue.4 , pp. 440-457
    • Selman, A.1
  • 23
    • 0025507099 scopus 로고
    • Bounded query classes
    • K. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833-846, 1990.
    • (1990) SIAM Journal on Computing , vol.19 , Issue.5 , pp. 833-846
    • Wagner, K.1
  • 24
    • 0000205276 scopus 로고
    • Some consequences of non-uniform conditions on uniform classes
    • C. Yap. Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26:287-300, 1983.
    • (1983) Theoretical Computer Science , vol.26 , pp. 287-300
    • Yap, C.1


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