메뉴 건너뛰기
Proceedings of the Annual IEEE Conference on Computational Complexity
Volumn , Issue , 2000, Pages 2-13
Time-space tradeoffs for nondeterministic computation
Author keywords

[No Author keywords available]
Indexed keywords

COMPUTABILITY AND DECIDABILITY; HIERARCHICAL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES; TURING MACHINES;
EID: 0033698267     PISSN: 10930159     EISSN: None     Source Type: Journal    
DOI: 10.1109/CCC.2000.856730     Document Type: Article
Times cited : (32)
References (19)
  • 1
    • 0003335813 scopus 로고
    • EATCS Monographs on Theoretical Computer Science
    • Structural Complexity I Springer-Verlag
    • J. Balcázar J. Díaz J. Gabarró EATCS Monographs on Theoretical Computer Science 11 1995 Springer-Verlag Structural Complexity I
    • (1995) , vol.11
    • Balcázar, J.1    Díaz, J.2    Gabarró, J.3
  • 2
    • 0011007901 scopus 로고
    • On time-space classes and their relation to the theory of real addition
    • A. Bruss A. Meyer On time-space classes and their relation to the theory of real addition Theoretical Computer Science 11 59 69 1980
    • (1980) Theoretical Computer Science , vol.11 , pp. 59-69
    • Bruss, A.1    Meyer, A.2
  • 3
    • 0023825720 scopus 로고
    • Short propositional formulas represent nondeterministic computations
    • S. Cook Short propositional formulas represent nondeterministic computations Information Processing Letters 26 269 270 1988
    • (1988) Information Processing Letters , vol.26 , pp. 269-270
    • Cook, S.1
  • 4
    • 50249162912 scopus 로고    scopus 로고
    • Nondeterministic polynomial time versus nondeterministic logarithmic space: Time-space tradeoffs for satisfiability
    • L. Fortnow Nondeterministic polynomial time versus nondeterministic logarithmic space: Time-space tradeoffs for satisfiability Proceedings of the 12th IEEE Conference on Computational Complexity 52 60 Proceedings of the 12th IEEE Conference on Computational Complexity 1997
    • (1997) , pp. 52-60
    • Fortnow, L.1
  • 5
    • 0027595217 scopus 로고
    • Interactive proof systems and alternating time-space complexity
    • L. Fortnow C. Lund Interactive proof systems and alternating time-space complexity Theoretical Computer Science 113 55 73 1993
    • (1993) Theoretical Computer Science , vol.113 , pp. 55-73
    • Fortnow, L.1    Lund, C.2
  • 6
    • 85030629189 scopus 로고
    • Nearly-linear time
    • Y. Gurevich S. Shelah Nearly-linear time Proceedings, Logic at Botik '89, volume 363 of Lecture Notes in Computer Science 108 118 Proceedings, Logic at Botik '89, volume 363 of Lecture Notes in Computer Science 1989
    • (1989) , pp. 108-118
    • Gurevich, Y.1    Shelah, S.2
  • 7
    • 0006672480 scopus 로고
    • Two-tape simulation of multitape Turing machines
    • F. Hennie R. Stearns Two-tape simulation of multitape Turing machines Journal of the ACM 13 533 546 1966
    • (1966) Journal of the ACM , vol.13 , pp. 533-546
    • Hennie, F.1    Stearns, R.2
  • 8
    • 0002036117 scopus 로고
    • Towards separating nondeterminism from determinism
    • R. Kannan Towards separating nondeterminism from determinism Mathematical Systems Theory 17 29 45 1986
    • (1986) Mathematical Systems Theory , vol.17 , pp. 29-45
    • Kannan, R.1
  • 10
    • 0032613872 scopus 로고    scopus 로고
    • On the complexity of SAT
    • R. Lipton A. Viglas On the complexity of SAT Proceedings of the 40th IEEE Symposium on Foundations of Computer Science 459 464 Proceedings of the 40th IEEE Symposium on Foundations of Computer Science 1999
    • (1999) , pp. 459-464
    • Lipton, R.1    Viglas, A.2
  • 11
    • 0000496365 scopus 로고
    • Rudimentary predicates and Turing calculations
    • V. Nepomnjaščiĭ Rudimentary predicates and Turing calculations Soviet Mathematics—Doklady 11 1462 1465 1970
    • (1970) Soviet Mathematics—Doklady , vol.11 , pp. 1462-1465
    • Nepomnjaščiĭ, V.1
  • 12
    • 0003897694 scopus 로고
    • Computational Complexity
    • Addison-Wesley
    • C. Papadimitriou Computational Complexity 1994 Addison-Wesley
    • (1994)
    • Papadimitriou, C.1
  • 14
    • 0018456413 scopus 로고
    • Relations among complexity measures
    • N. Pippenger M. Fischer Relations among complexity measures Journal of the ACM 26 361 381 1979
    • (1979) Journal of the ACM , vol.26 , pp. 361-381
    • Pippenger, N.1    Fischer, M.2
  • 15
    • 85177136562 scopus 로고    scopus 로고
    • R. Santhanam Personal communication October 1999
    • (1999)
    • Santhanam, R.1
  • 16
    • 84976654190 scopus 로고
    • Satisfiability is quasilinear complete in NQL
    • C. Schnorr Satisfiability is quasilinear complete in NQL Journal of the ACM 25 136 145 1978
    • (1978) Journal of the ACM , vol.25 , pp. 136-145
    • Schnorr, C.1
  • 17
    • 84976764290 scopus 로고
    • Separating nondeterministic time complexity classes
    • J. Seiferas M. Fischer A. Meyer Separating nondeterministic time complexity classes Journal of the ACM 25 146 167 1978
    • (1978) Journal of the ACM , vol.25 , pp. 146-167
    • Seiferas, J.1    Fischer, M.2    Meyer, A.3
  • 18
    • 85177111036 scopus 로고    scopus 로고
    • Time-space lower bounds for sat on uniform and non-uniform machines
    • I. Tourlakis Time-space lower bounds for sat on uniform and non-uniform machines these proceedings these proceedings
    • Tourlakis, I.1
  • 19
    • 0000589271 scopus 로고
    • A Turing machine time hierarchy
    • S. Žàk A Turing machine time hierarchy Theoretical Computer Science 26 327 333 1983
    • (1983) Theoretical Computer Science , vol.26 , pp. 327-333
    • Žàk, S.1

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