Proof complexity of symbolic QBF reasoning (Q2118330)

From MaRDI portal
Revision as of 15:29, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Proof complexity of symbolic QBF reasoning
scientific article

    Statements

    title
    Proof complexity of symbolic QBF reasoning (English)
    0 references
    author
    Stefan Mengel
    0 references
    Friedrich Slivovsky
    0 references
    publication date
    22 March 2022
    0 references
    describes a project that uses
    CUDD
    0 references
    Quaffle
    0 references
    DepQBF
    0 references
    QESTO
    0 references
    RAReQS
    0 references
    CAQE
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68R07
    0 references
    68T20
    0 references
    zbMATH DE Number
    7495588
    0 references
    OpenAlex ID
    W3184676641
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2118330&oldid=31175633"
    Powered by MediaWiki