Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
JSAT
2010
2010
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
Real-time TrafficRelated Content
| Added | 19 May 2011 |
| Updated | 19 May 2011 |
| Type | Journal |
| Year | 2010 |
| Where | JSAT |
| Authors | Olga Tveretina, Carsten Sinz, Hans Zantema |
Comments (0)
Researcher Info
|
