A direct construction of polynomial-size OBDD proof of pigeon hole problem (Q987797)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A direct construction of polynomial-size OBDD proof of pigeon hole problem |
scientific article; zbMATH DE number 5771243
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A direct construction of polynomial-size OBDD proof of pigeon hole problem |
scientific article; zbMATH DE number 5771243 |
Statements
A direct construction of polynomial-size OBDD proof of pigeon hole problem (English)
0 references
16 August 2010
0 references
propositional proof systems
0 references
binary decision diagrams
0 references
pigeonhole problem
0 references
proof complexity
0 references
computational complexity
0 references
0 references
0.8403069376945496
0 references
0.8041730523109436
0 references
0.7882235646247864
0 references
0.7804576754570007
0 references
