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. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
On Resolution Complexity of Matching Principles - Dantchev (2002) (Correct)
No context found.
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.
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