메뉴 건너뛰기




Volumn 15, Issue 4, 2006, Pages 433-470

Inductive time-space lower bounds for sat and related problems

Author keywords

Bounded nondeterminism; Diagonalization; Lower bounds; Polynomial time hierarchy; Satisfiability; Time space tradeoffs

Indexed keywords


EID: 34249034042     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-007-0221-1     Document Type: Conference Paper
Times cited : (16)

References (26)
  • 1
    • 0000491637 scopus 로고    scopus 로고
    • On the Amount of Nondeterminism and the Power of Verifying
    • L. Cai and J. Chen. On the Amount of Nondeterminism and the Power of Verifying. SIAM J. Comput. 26(3):733-750, 1997.
    • (1997) SIAM J. Comput , vol.26 , Issue.3 , pp. 733-750
    • Cai, L.1    Chen, J.2
  • 5
    • 0023825720 scopus 로고
    • Short Prepositional Formulas Represent Nondeterministic Computations
    • S. A. Cook. Short Prepositional Formulas Represent Nondeterministic Computations. Inf. Process. Lett. 26(5): 269-270 (1988)
    • (1988) Inf. Process. Lett , vol.26 , Issue.5 , pp. 269-270
    • Cook, S.A.1
  • 6
    • 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. In Proceedings of IEEE Conference on Computational Complexity, 52-60, 1997.
    • (1997) Proceedings of IEEE Conference on Computational Complexity , pp. 52-60
    • Fortnow, L.1
  • 9
    • 85030629189 scopus 로고
    • Nearly Linear Time
    • Logic at Botik'89, Symposium on Logical Foundations of Computer Science
    • Y. Gurevich and S. Shelah. Nearly Linear Time. In Logic at Botik'89, Symposium on Logical Foundations of Computer Science, Springer LNCS 363:108-118, 1989.
    • (1989) Springer LNCS , vol.363 , pp. 108-118
    • Gurevich, Y.1    Shelah, S.2
  • 12
    • 0020891102 scopus 로고
    • Alternation and the Power of Nondeterminism
    • R. Kannan. Alternation and the Power of Nondeterminism. In Proceedings of ACM STOC, 344-346, 1983.
    • (1983) Proceedings of ACM STOC , vol.344-346
    • Kannan, R.1
  • 13
    • 0002036117 scopus 로고
    • Towards Separating Nondeterminism from Determinism
    • R. Kannan. Towards Separating Nondeterminism from Determinism. Mathematical Systems Theory 17(1):29-45, 1984.
    • (1984) Mathematical Systems Theory , vol.17 , Issue.1 , pp. 29-45
    • Kannan, R.1
  • 15
    • 0023288434 scopus 로고
    • Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape
    • W. Maass and A. Schorr. Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape. SIAM J. Comput. 16(1):195-202, 1987.
    • (1987) SIAM J. Comput , vol.16 , Issue.1 , pp. 195-202
    • Maass, W.1    Schorr, A.2
  • 16
    • 35048855636 scopus 로고    scopus 로고
    • A Time Lower Bound for Satisfiability
    • D. van Melkebeek and R. Raz. A Time Lower Bound for Satisfiability. In Proceedings of ICALP, 971-982, 2004.
    • (2004) Proceedings of ICALP , vol.971-982
    • van Melkebeek, D.1    Raz, R.2
  • 17
    • 26444585245 scopus 로고    scopus 로고
    • Time-Space Lower Bounds for NP-Complete Problems
    • G. Paun, G. Rozenberg, and A. Salomaa eds, World Scientific
    • D. van Melkebeek. Time-Space Lower Bounds for NP-Complete Problems. In G. Paun, G. Rozenberg, and A. Salomaa (eds.), Current Trends in Theoretical Computer Science, 265-291, World Scientific, 2004.
    • (2004) Current Trends in Theoretical Computer Science , pp. 265-291
    • van Melkebeek, D.1
  • 18
    • 0000496365 scopus 로고
    • Rudimentary Predicates and Turing Calculations
    • V. Nepomnjascii. Rudimentary Predicates and Turing Calculations. Soviet Mathematics Doklady, 11:1462-1465, 1970.
    • (1970) Soviet Mathematics Doklady , vol.11 , pp. 1462-1465
    • Nepomnjascii, V.1
  • 19
    • 0004070686 scopus 로고
    • On Time versus Space II. (Turing Machines)
    • W. J. Paul and R. Reischuk. On Time versus Space II. (Turing Machines). J. Comput. Syst. Sci. 22(3):312-327, 1981.
    • (1981) J. Comput. Syst. Sci , vol.22 , Issue.3 , pp. 312-327
    • Paul, W.J.1    Reischuk, R.2
  • 21
    • 0018456413 scopus 로고
    • Relations Among Complexity Measures
    • N. Pippenger and M. J. Fischer. Relations Among Complexity Measures. Journal of the ACM 26(2):361-381, 1979.
    • (1979) Journal of the ACM , vol.26 , Issue.2 , pp. 361-381
    • Pippenger, N.1    Fischer, M.J.2
  • 22
    • 0035885377 scopus 로고    scopus 로고
    • Lower Bounds on the Complexity of Recognizing SAT by Turing Machines
    • R. Santhanam. Lower Bounds on the Complexity of Recognizing SAT by Turing Machines. Info. Proc. Lett. 79(5):243-247, 2001.
    • (2001) Info. Proc. Lett , vol.79 , Issue.5 , pp. 243-247
    • Santhanam, R.1
  • 23
    • 0014776888 scopus 로고
    • Relationships Between Nondeterministic and Deterministic Tape Complexities
    • W. J. Savitch. Relationships Between Nondeterministic and Deterministic Tape Complexities. J. Comput. Syst. Sci. 4(2): 177-192, 1970.
    • (1970) J. Comput. Syst. Sci , vol.4 , Issue.2 , pp. 177-192
    • Savitch, W.J.1
  • 24
    • 84976654190 scopus 로고
    • Satisfiability is Quasilinear Complete in NQL
    • C. P. Schnorr. Satisfiability is Quasilinear Complete in NQL. J. of the ACM 25(1):136-145, 1978.
    • (1978) J. of the ACM , vol.25 , Issue.1 , pp. 136-145
    • Schnorr, C.P.1
  • 25
    • 0040484892 scopus 로고    scopus 로고
    • Time-Space Tradeoffs for SAT on Nonuniform Machines
    • I. Tourlakis. Time-Space Tradeoffs for SAT on Nonuniform Machines. J. Comput. Syst. Sci. 63(2): 268-287, 2001.
    • (2001) J. Comput. Syst. Sci , vol.63 , Issue.2 , pp. 268-287
    • Tourlakis, I.1


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