Pages that link to "Item:Q2387426"
From MaRDI portal
The following pages link to The complexity of modular decomposition of Boolean functions (Q2387426):
Displaying 7 items.
- Algorithmic issues of AND-decomposition of Boolean formulas (Q300345) (← links)
- An algorithm to construct Gilbert's decomposition and its implementation for the circuit design problem (Q851996) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- The complexity of AND-decomposition of Boolean functions (Q2181249) (← links)
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
- AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables (Q2795943) (← links)
- (Q4259977) (← links)