Communications of the ACM
Are search and decision programs computationally equivalent?
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On the learnability of Boolean formulae
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Learning regular sets from queries and counterexamples
Information and Computation
Computational limitations on learning from examples
Journal of the ACM (JACM)
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Negative Results for Equivalence Queries
Machine Learning
Identifying μ-formula decision trees with queries
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Learning switch configurations
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Learning read-once formulas using membership queries
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Learning context-free grammars from structural data in polynomial time
Theoretical Computer Science
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields
SIAM Journal on Computing
When won't membership queries help?
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Learning in the presence of finitely or infinitely many irrelevant attributes
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Learning 2u DNF formulas and ku decision trees
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Learning read-once formulas over fields and extended bases
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Combinatorial characterization of read-once formulae
Discrete Mathematics - Special issue on combinatorics and algorithms
Computational Complexity of Machine Learning
Computational Complexity of Machine Learning
Machine Learning
Machine Learning
On characterizing and learning some classes of read-once functions
On characterizing and learning some classes of read-once functions
Learning arithmetic read-once formulas
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Exact learning of read-k disjoint DNF and not-so-disjoint DNF
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Learning &mgr;-branching programs with queries
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On the limits of proper learnability of subclasses of DNF formulas
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
On learning counting functions with queries
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning with queries but incomplete information (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning from a consistently ignorant teacher
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
How many queries are needed to learn?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Generalized teaching dimensions and the query complexity of learning
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
On learning decision trees with large output domains (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
On the learnability of Zn-DNF formulas (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Simple learning algorithms using divide and conquer
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
How many queries are needed to learn?
Journal of the ACM (JACM)
Attribute-efficient learning in query and mistake-bound models
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Exact Learning of Formulas in Parallel
Machine Learning
Generating all maximal independent sets of bounded-degree hypergraphs
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Learning from examples with unspecified attribute values (extended abstract)
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Structural results about exact learning with unspecified attribute values
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
The query complexity of finding local minima in the lattice
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On theory revision with queries
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
On the Sample Complexity for Nonoverlapping Neural Networks
Machine Learning
The query complexity of finding local minima in the lattice
Information and Computation
Theory Revision with Queries: DNF Formulas
Machine Learning
On the Sample Complexity for Neural Trees
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning Sub-classes of Monotone DNF on the Uniform Distribution
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Boolean Formulas are Hard to Learn for most Gate Bases
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Learning Intermediate Concepts
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Learning from examples with unspecified attribute values
Information and Computation
On polynomial-time preference elicitation with value queries
Proceedings of the 4th ACM conference on Electronic commerce
More efficient PAC-learning of DNF with membership queries under the uniform distribution
Journal of Computer and System Sciences
Preference Elicitation and Query Learning
The Journal of Machine Learning Research
Theory revision with queries: horn, read-once, and parity formulas
Artificial Intelligence
Learning a circuit by injecting values
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The complexity of learning concept classes with polynomial general dimension
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Learning languages from positive data and a finite number of queries
Information and Computation
Learning attribute-efficiently with corrupt oracles
Theoretical Computer Science
Read-once polynomial identity testing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An improvement on the complexity of factoring read-once Boolean functions
Discrete Applied Mathematics
Learning a circuit by injecting values
Journal of Computer and System Sciences
On the Readability of Monotone Boolean Formulae
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Learning languages from positive data and a finite number of queries
Information and Computation
Learning large-alphabet and analog circuits with value injection queries
COLT'07 Proceedings of the 20th annual conference on Learning theory
Probably approximately correct learning
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Algorithms and theory of computation handbook
Learning read once functions using subcube parity queries
Computational Mathematics and Modeling
Learning read-constant polynomials of constant degree modulo composites
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On the readability of monotone Boolean formulae
Journal of Combinatorial Optimization
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Learning attribute-efficiently with corrupt oracles
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Learning languages from positive data and a finite number of queries
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Reconstructing boolean models of signaling
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
Learning and verifying quantified boolean queries by example
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.01 |
A read-once formula is a Boolean formula in which each variable occurs, at most, once. Such formulas are also called &mgr;-formulas or Boolean trees. This paper treats the problem of exactly identifying an unknown read-once formula using specific kinds of queries.The main results are a polynomial-time algorithm for exact identification of monotone read-once formulas using only membership queries, and a polynomial-time algorithm for exact identification of general read-once formulas using equivalence and membership queries (a protocol based on the notion of a minimally adequate teacher [1]). The results of the authors improve on Valiant's previous results for read-once formulas [26]. It is also shown, that no polynomial-time algorithm using only membership queries or only equivalence queries can exactly identify all read-once formulas.