Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
From MaRDI portal
Recommendations
Cited in
(23)- Learning Boolean read-once formulas over generalized bases
- Learning fallible deterministic finite automata
- Characterizing arithmetic read-once formulae
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- On transformations of probability distributions by read-once quasigroup formulae
- Learning with errors in answers to membership queries
- From learning in the limit to stochastic finite learning
- Exact learning from an honest teacher that answers membership queries
- On the Expressive Power of Read-Once Determinants
- Separating Models of Learning with Faulty Teachers
- Combinatorial results on the complexity of teaching and learning
- Separating models of learning with faulty teachers
- Learning with unreliable boundary queries
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Read-Once Functions Revisited and the Readability Number of a Boolean Function
- An algorithm to learn read-once threshold formulas, and transformations between learning models
- Locating errors in faulty formulas
- Learning Arithmetic Read-Once Formulas
- Learning with queries corrupted by classification noise
- scientific article; zbMATH DE number 67616 (Why is no real title available?)
- Learning read-once formulas with queries
- Testing formula satisfaction
- On specifying Boolean functions by labelled examples
This page was built for publication: Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137706)
