The complexity of modular decomposition of Boolean functions (Q2387426): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2003.12.010 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q5600472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the composition and decomposition of clutters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of identification and dualization of positive Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum self-dual decompositions of positive dual-minor Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modules of Coherent Binary Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Modular Decomposition of Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposability of partially defined Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatroidal independence systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5562602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to find the smallest committee containing a given set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning by discovering concept hierarchies / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2003.12.010 / rank
 
Normal rank

Latest revision as of 08:22, 18 December 2024

scientific article
Language Label Description Also known as
English
The complexity of modular decomposition of Boolean functions
scientific article

    Statements

    The complexity of modular decomposition of Boolean functions (English)
    0 references
    0 references
    2 September 2005
    0 references
    Boolean function
    0 references
    computational complexity
    0 references
    modular set
    0 references
    modular closure
    0 references
    generalized Shannon decomposition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references