The Complexity of Very Simple Boolean Formulas with Applications (Q3474280): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968653910 / rank
 
Normal rank

Latest revision as of 01:32, 20 March 2024

scientific article
Language Label Description Also known as
English
The Complexity of Very Simple Boolean Formulas with Applications
scientific article

    Statements

    The Complexity of Very Simple Boolean Formulas with Applications (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references