Kazuo Iwama, Shuichi Miyazaki  Home/Search
Context Related
| lab2.kuis.kyotou.ac.jp/~sh...isaac3.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lab2.kuis.kyotou.ac.jp...papere (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Our main result shows that a shortest proof size of tree-like resolution for the pigeonhole principle is superpolynomially larger than that of DAG-like resolution. In the proof of a lower bound, we exploit a relationship between tree-like resolution and backtracking, which has long been recognized in this field but not been used before to give explicit results. 1 Introduction A proof system is a nondeterministic procedure to prove the unsatisfiability of CNF formulas, which proceeds by... (Update)
Similar documents based on text: More All
0.4: Testing satisfiability of CNF formulas by computing a stable set .. - Goldberg (2002) (Correct)
0.3: Lower Bounds for the Weak Pigeonhole Principle and.. - Atserias, Bonet, Esteban (2002) (Correct)
0.3: Inclusion-Exclusion for k-CNF Formulas - Iwama, Matsuura (2002) (Correct)
BibTeX entry: (Update)
K. Iwama and S. Miyazaki. Tree-like resolution is superpolynomially slower than DAG-like resolution for the pigeonhole principle. In Algorithms and computation (Chennai, 1999. http://citeseer.ist.psu.edu/iwama99treelike.html More
@inproceedings{ iwama99treelike,
author = "Iwama and Miyazaki",
title = "Tree-Like Resolution Is Superpolynomially Slower Than {DAG}-Like Resolution for the Pigeonhole Principle",
booktitle = "{ISAAC}: 10th International Symposium on Algorithms and Computation (formerly {SIGAL} International Symposium on Algorithms), Organized by Special Interest Group on Algorithms ({SIGAL}) of the Information Processing Society of Japan ({IPSJ}) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers ({IEICE}))",
year = "1999",
url = "citeseer.ist.psu.edu/iwama99treelike.html" }
Citations (may not include all citations):127 The relative efficiency of propositional proof systems (context) - Cook, Reckhow - 1979
66 The complexity of propositional proofs - Urquhart - 1995
62 Simplified and improved resolution lower bounds - Beame, Pitassi - 1996
52 The intractability of resolution (context) - Haken - 1985
48 Polynomial size proofs of the propositional pigeonhole princ.. (context) - Buss - 1987
31 Resolution and the weak pigeonhole principle - Buss, Pitassi - 1997
19 Exponential separations between restricted resolution and cu.. - Bonet, Esteban et al. - 1998
3 Read-Once Branching programs, rectangular proofs of the pige.. - Razborov, Wigderson et al. - 1997
2 A survey of average time analysis of satisfiability algorith.. (context) - Purdom - 1990
Documents on the same site (http://www.lab2.kuis.kyoto-u.ac.jp/~shuichi/research/paper-e.html): More
Database Queries as. . . - Miyazaki, al. (1996) (Correct)
SAT-Variable Complexity of Hard Combinatorial Problems - Iwama, Miyazaki (1994) (Correct)
Local Search Algorithms for Partial MAXSAT - Cha, Iwama, Kambayashi, Miyazaki (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC