Unsatisfiable Linear CNF Formulas Are Large and Complex. (Q3113785)

From MaRDI portal
Revision as of 11:00, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Unsatisfiable Linear CNF Formulas Are Large and Complex.
scientific article

    Statements

    author
    Dominik Scheder
    0 references
    publication date
    23 January 2012
    0 references
    zbMATH Keywords
    extremal combinatorics
    0 references
    proof complexity
    0 references
    probabilistic method
    0 references
    title
    Unsatisfiable Linear CNF Formulas Are Large and Complex. (English)
    0 references

    Identifiers

    zbMATH DE Number
    5999732
    0 references
    OpenAlex ID
    W2962941898
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3113785&oldid=37383244"
    Powered by MediaWiki