The complexity of Boolean formula minimization (Q619911)

From MaRDI portal
Revision as of 16:48, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of Boolean formula minimization
scientific article

    Statements

    title
    The complexity of Boolean formula minimization (English)
    0 references
    author
    David Buchfuhrer
    0 references
    Christopher Umans
    0 references
    publication date
    18 January 2011
    0 references
    zbMATH DE Number
    5838481
    0 references
    zbMATH Keywords
    formula minimization
    0 references
    computational complexity
    0 references
    logic synthesis
    0 references
    polynomial-time hierarchy
    0 references
    Turing reduction
    0 references
    Wikidata QID
    Q29300594
    0 references
    OpenAlex ID
    W2070023605
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q619911&oldid=35209524"
    Powered by MediaWiki