A direct construction of polynomial-size OBDD proof of pigeon hole problem (Q987797)

From MaRDI portal
Revision as of 02:30, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A direct construction of polynomial-size OBDD proof of pigeon hole problem
scientific article

    Statements

    A direct construction of polynomial-size OBDD proof of pigeon hole problem (English)
    0 references
    16 August 2010
    0 references
    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 references
    0 references