Pages that link to "Item:Q1751204"
From MaRDI portal
The following pages link to Recognition of tractable DNFs representable by a constant number of intervals (Q1751204):
Displaying 7 items.
- Relations between threshold and \(k\)-interval Boolean functions (Q646713) (← links)
- On limitations of structured (deterministic) DNNFs (Q778525) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- Computing the minimum DNF representation of Boolean functions defined by intervals (Q2387437) (← links)
- No Efficient Disjunction or Conjunction of Switch-Lists (Q5080958) (← links)
- Properties of Switch-List Representations of Boolean Functions (Q5130011) (← links)
- A faster implementation of EQ and SE queries for switch-list representations (Q6630718) (← links)