A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games
نویسندگان
چکیده
منابع مشابه
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games
In this note we show that the asymmetric Prover-Delayer game developed in (ECCC, TR10–059) for Parameterized Resolution is also applicable to other treelike proof systems. In particular, we use this asymmetric Prover-Delayer to show a lower bound of the form 2Ω(n logn) for the pigeonhole principle in tree-like Resolution. This gives a new and simpler proof of the same lower bound established by...
متن کاملA Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer GamesI
In this note we show that the asymmetric Prover-Delayer game developed in [BGL10] for Parameterized Resolution is also applicable to other tree-like proof systems. In particular, we use this asymmetric Prover-Delayer game to show a lower bound of the form 2 logn) for the pigeonhole principle in tree-like Resolution. This gives a new and simpler proof of the same lower bound established by Iwama...
متن کاملTree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle
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 eld but not been used before to give explicit results.
متن کاملImproved Resolution Lower Bounds for the Weak Pigeonhole Principle
Recently, Raz Raz01] established exponential lower bounds on the size of resolution proofs of the weak pigeonhole principle. We give another proof of this result which leads to better numerical bounds.
متن کاملResolution lower bounds for the weak functional pigeonhole principle
We show that every resolution proof of the functional version FPHPm n of the pigeonhole principle (in which one pigeon may not split between several holes) must have size exp ( Ω ( n (logm)2 )) . This implies an exp ( Ω(n1/3) ) bound when the number of pigeons m is arbitrary.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2010
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2010.09.007