The following pages link to (Q4695825):
Displayed 9 items.
- On the readability of monotone Boolean formulae (Q652622) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- An improvement on the complexity of factoring read-once Boolean functions (Q944714) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- Double Horn functions (Q1271644) (← links)
- Factoring Boolean functions using graph partitioning (Q2387436) (← 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)
- Decision lists and related Boolean functions (Q5958318) (← links)