Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
From MaRDI portal
Publication:3137706
DOI10.1137/0222047zbMath0786.68081OpenAlexW1982003460MaRDI QIDQ3137706
Robert E. Schapire, Sally A. Goldman, Michael Kearns
Publication date: 10 October 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://openscholarship.wustl.edu/cse_research/656
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
Exact learning from an honest teacher that answers membership queries ⋮ On specifying Boolean functions by labelled examples ⋮ Learning fallible deterministic finite automata ⋮ From learning in the limit to stochastic finite learning ⋮ An efficient membership-query algorithm for learning DNF with respect to the uniform distribution ⋮ Combinatorial results on the complexity of teaching and learning ⋮ Separating Models of Learning with Faulty Teachers ⋮ Learning with errors in answers to membership queries ⋮ Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees ⋮ Separating models of learning with faulty teachers ⋮ Locating Errors in Faulty Formulas ⋮ Learning with unreliable boundary queries ⋮ Learning with queries corrupted by classification noise ⋮ Read-Once Functions Revisited and the Readability Number of a Boolean Function
This page was built for publication: Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
