Pages that link to "Item:Q5958318"
From MaRDI portal
The following pages link to Decision lists and related Boolean functions (Q5958318):
Displaying 12 items.
- Improved time complexities for learning Boolean networks (Q280576) (← links)
- Version spaces and the consistency problem (Q814597) (← links)
- On the computational power of Boolean decision lists (Q853647) (← links)
- Measuring teachability using variants of the teaching dimension (Q924171) (← links)
- Linear read-once and related Boolean functions (Q1801039) (← links)
- Deciding atomicity of subword-closed languages (Q2163979) (← links)
- (Q4723530) (← links)
- No Efficient Disjunction or Conjunction of Switch-Lists (Q5080958) (← links)
- Properties of Switch-List Representations of Boolean Functions (Q5130011) (← links)
- Monotone term decision lists (Q5941293) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)
- Deciding atomicity of subword-closed languages (Q6549668) (← links)