A note on SAT algorithms and proof complexity (Q436581)

From MaRDI portal
Revision as of 01:36, 9 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)
scientific article
Language Label Description Also known as
English
A note on SAT algorithms and proof complexity
scientific article

    Statements

    title
    A note on SAT algorithms and proof complexity (English)
    0 references
    author
    Jan Krajíček
    0 references
    publication date
    25 July 2012
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    SAT algorithms
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68T20
    0 references
    03B70
    0 references
    zbMATH DE Number
    6059694
    0 references
    OpenAlex ID
    W2009304285
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q436581&oldid=38106135"
    Powered by MediaWiki