On the efficiency of normal form systems for representing Boolean functions (Q1989340): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q126343109, #quickstatements; #temporary_batch_1719448105926
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2020.01.009 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Size-depth tradeoffs for Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composition of Post classes and normal forms of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Galois theory for sets of operations closed under permutation, cylindrification, and composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of functions based on arity gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4583802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post classes characterized by functional terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function Algebras on Finite Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted lattice polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5344158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essential arities of term operations in finite algebras / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2020.01.009 / rank
 
Normal rank

Latest revision as of 16:45, 16 December 2024

scientific article
Language Label Description Also known as
English
On the efficiency of normal form systems for representing Boolean functions
scientific article

    Statements

    On the efficiency of normal form systems for representing Boolean functions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 April 2020
    0 references
    Boolean function
    0 references
    normal-form system
    0 references
    complexity
    0 references
    efficient representation
    0 references

    Identifiers