메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 1741, Issue , 1999, Pages 133-142
Tree-like resolution is superpolynomially slower than dag-like resolution for the pigeonhole principle
Author keywords

[No Author keywords available]
Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;
EID: 84958059041     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_14     Document Type: Conference Paper
Times cited : (8)
References (9)
  • 1
    • 0030396103 scopus 로고    scopus 로고
    • Simplified and improved resolution lower bounds
    • P. Beame and T. Pitassi, "Simplified and improved resolution lower bounds," Proc. FOCS'96, pp. 274-282, 1996.
    • (1996) Proc. FOCS'96 , pp. 274-282
    • Beame, P.1    Pitassi, T.2
  • 2
    • 0032305706 scopus 로고    scopus 로고
    • Exponential separations between restricted resolution and cutting planes proof systems
    • M. L. Bonet, J. L. Esteban, N. Galesi and J. Johannsen, “Exponential separations between restricted resolution and cutting planes proof systems," Proc. FOCS'98, pp. 638-647, 1998.
    • (1998) Proc. FOCS'98 , pp. 638-647
    • Bonet, M.L.1    Esteban, J.L.2    Galesi, N.3    Johannsen, J.4
  • 3
    • 0000297004 scopus 로고
    • Polynomial size proofs of the propositional pigeonhole principle
    • S. Buss, “Polynomial size proofs of the propositional pigeonhole principle," Journal of Symbolic Logic, 52, pp. 916-927, 1987.
    • (1987) Journal of Symbolic Logic , vol.52 , pp. 916-927
    • Buss, S.1
  • 4
    • 84957616496 scopus 로고    scopus 로고
    • Resolution and the weak pigeonhole principle
    • S. Buss and T. Pitassi, "Resolution and the weak pigeonhole principle," Proc. CSL'97, LNCS 1414, pp.149-156, 1997.
    • (1997) Proc. CSL'97, LNCS , vol.1414 , pp. 149-156
    • Buss, S.1    Pitassi, T.2
  • 5
    • 0001601465 scopus 로고
    • The relative efficiency of propositional proof systems
    • S. A. Cook and R. A. Reckhow, “The relative efficiency of propositional proof systems," J. Symbolic Logic, 44(1), pp. 36-50, 1979.
    • (1979) J. Symbolic Logic , vol.44 , Issue.1 , pp. 36-50
    • Cook, S.A.1    Reckhow, R.A.2
  • 6
    • 0000076101 scopus 로고
    • The intractability of resolution
    • A. Haken, “The intractability of resolution," Theoretical Computer Science, 39, pp. 297-308, 1985.
    • (1985) Theoretical Computer Science , vol.39 , pp. 297-308
    • Haken, A.1
  • 7
    • 0025555090 scopus 로고
    • A survey of average time analysis of satisfiability algorithms
    • P. Purdom, “A survey of average time analysis of satisfiability algorithms," Journal of Information Processing, 13(4), pp.449-455, 1990.
    • (1990) Journal of Information Processing , vol.13 , Issue.4 , pp. 449-455
    • Purdom, P.1
  • 8
    • 0030642913 scopus 로고    scopus 로고
    • Read-Once Branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus
    • A. A. Razborov, A. Wigderson and A. Yao, “Read-Once Branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus," Proc. STOC'97, pp. 739-748, 1997.
    • (1997) Proc. STOC'97 , pp. 739-748
    • Razborov, A.A.1    Wigderson, A.2    Yao, A.3
  • 9
    • 84974079324 scopus 로고
    • The complexity of propositional proofs
    • A. Urquhart, “The complexity of propositional proofs," The Bulletin of Symbolic Logic, Vol. 1, No. 4, pp. 425-467, 1995.
    • (1995) The Bulletin of Symbolic Logic , vol.1 , Issue.4 , pp. 425-467
    • Urquhart, A.1

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