Pages that link to "Item:Q2181249"
From MaRDI portal
The following pages link to The complexity of AND-decomposition of Boolean functions (Q2181249):
Displaying 7 items.
- Algorithmic issues of AND-decomposition of Boolean formulas (Q300345) (← links)
- Positive and Horn decomposability of partially defined Boolean functions (Q1356507) (← links)
- Decomposability of partially defined Boolean functions (Q1900137) (← links)
- Minimum self-dual decompositions of positive dual-minor Boolean functions (Q1961458) (← links)
- On the relationship between the complexity of decidability and decomposability of first-order theories (Q2062094) (← links)
- The complexity of modular decomposition of Boolean functions (Q2387426) (← links)
- Universal Perceptron Theory on Decomposition Structures of <i>n</i>-Bit Boolean Functions (Q4973588) (← links)