Pages that link to "Item:Q2492223"
From MaRDI portal
The following pages link to Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223):
Displayed 14 items.
- Knowledge compilation meets database theory: compiling queries to decision diagrams (Q359877) (← links)
- On the readability of monotone Boolean formulae (Q652622) (← links)
- The micro-world of cographs (Q831855) (← links)
- An improvement on the complexity of factoring read-once Boolean functions (Q944714) (← links)
- Coupon coloring of cographs (Q1738081) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- On lengths of edge-labeled graph expressions (Q2161278) (← links)
- The complexity of AND-decomposition of Boolean functions (Q2181249) (← links)
- Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs (Q2357161) (← links)
- Estimation of expressions' complexities for two-terminal directed acyclic graphs (Q2413344) (← links)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
- Read-Once Functions Revisited and the Readability Number of a Boolean Function (Q3439365) (← links)
- Covering a Tree by a Forest (Q3655140) (← links)
- On the Readability of Monotone Boolean Formulae (Q5323097) (← links)