Pages that link to "Item:Q3137706"
From MaRDI portal
The following pages link to Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions (Q3137706):
Displaying 14 items.
- From learning in the limit to stochastic finite learning (Q860825) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- Learning with unreliable boundary queries (Q1271553) (← links)
- Learning with queries corrupted by classification noise (Q1304475) (← links)
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
- On specifying Boolean functions by labelled examples (Q1897365) (← links)
- Learning fallible deterministic finite automata (Q1900974) (← links)
- Learning with errors in answers to membership queries (Q2462498) (← links)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Read-Once Functions Revisited and the Readability Number of a Boolean Function (Q3439365) (← links)
- Separating Models of Learning with Faulty Teachers (Q3520052) (← links)
- Locating Errors in Faulty Formulas (Q4972679) (← links)
- Combinatorial results on the complexity of teaching and learning (Q5096898) (← links)
