The Complexity of Very Simple Boolean Formulas with Applications (Q3474280)

From MaRDI portal
Revision as of 01:32, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Complexity of Very Simple Boolean Formulas with Applications
scientific article

    Statements

    title
    The Complexity of Very Simple Boolean Formulas with Applications (English)
    0 references
    DOI
    10.1137/0219003
    0 references
    author
    Richard E. Stearns
    0 references
    Harry B. III Hunt
    0 references
    publication date
    1990
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    03D15
    0 references
    03G99
    0 references
    94C10
    0 references
    06B99
    0 references
    06D99
    0 references
    zbMATH DE Number
    4141501
    0 references
    zbMATH Keywords
    complexity
    0 references
    NP-completeness
    0 references
    decision problems
    0 references
    modular arithmetic
    0 references
    binary decision diagrams
    0 references
    program schemes
    0 references
    finite and distributive lattices
    0 references
    fault detection
    0 references
    SAT-completeness
    0 references
    Boolean formulas
    0 references
    finite fields
    0 references
    OpenAlex ID
    W1968653910
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3474280&oldid=32609423"
    Powered by MediaWiki