Sciweavers

Share
JSAT
2010

Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond

8 years 8 months ago
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond
Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has exponential size, and that limited OBDD derivations cannot simulate resolution polynomially. Here we show that an arbitrary OBDD refutation of the pigeonhole formula has exponential size: we prove that for any order of computation at least one in
Olga Tveretina, Carsten Sinz, Hans Zantema
Added 19 May 2011
Updated 19 May 2011
Type Journal
Year 2010
Where JSAT
Authors Olga Tveretina, Carsten Sinz, Hans Zantema
Comments (0)
books