The following pages link to (Q4230377):
Displayed 8 items.
- On the limits of proper learnability of subclasses of DNF formulas (Q676245) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- A linear time equivalence test for read-twice DNF formulas (Q1334630) (← links)
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
- The learnability of unions of two rectangles in the two-dimensional discretized space (Q1807675) (← links)
- On the geometric separability of Boolean functions (Q1917289) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)