Characteristic Sets for Polynomial Grammatical Inference
Machine Learning
A dichotomy theorem for learning quantified Boolean formulas
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Exact learning of tree patterns from queries and counterexamples
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
A Dichotomy Theorem for Learning Quantified Boolean Formulas
Machine Learning - Special issue: computational learning theory, COLT '97
SIGACT News complexity theory column 32
ACM SIGACT News
Active learning in neural networks
New learning paradigms in soft computing
Exact learning of DNF formulas using DNF hypotheses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Separating Quantum and Classical Learning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Learning Expressions over Monoids
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Learning Range Restricted Horn Expressions
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Learnability of Quantified Formulas
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Boolean Formulas are Hard to Learn for most Gate Bases
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
The Complexity of Learning Concept Classes with Polynomial General Dimension
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Prediction-Preserving Reducibility with Membership Queries on Formal Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Learning elementary formal systems with queries
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Learnability of quantified formulas
Theoretical Computer Science
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
Theory revision with queries: horn, read-once, and parity formulas
Artificial Intelligence
Exact learning of DNF formulas using DNF hypotheses
Journal of Computer and System Sciences - Special issue on COLT 2002
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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 expressions and programs over monoids
Information and Computation
Optimally Learning Social Networks with Activations and Suppressions
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Learning Balls of Strings from Edit Corrections
The Journal of Machine Learning Research
Learning a circuit by injecting values
Journal of Computer and System Sciences
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Journal of Computer and System Sciences
Learning expressions and programs over monoids
Information and Computation
Learning Acyclic Probabilistic Circuits Using Test Paths
The Journal of Machine Learning Research
Learning large-alphabet and analog circuits with value injection queries
COLT'07 Proceedings of the 20th annual conference on Learning theory
Optimally learning social networks with activations and suppressions
Theoretical Computer Science
Canonical horn representations and query learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Efficient, correct, unsupervised learning of context-sensitive languages
CoNLL '10 Proceedings of the Fourteenth Conference on Computational Natural Language Learning
Algorithms and theory of computation handbook
Towards general algorithms for grammatical inference
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Tractability and Learnability Arising from Algebras with Few Subpowers
SIAM Journal on Computing
A learnable representation for syntax using residuated lattices
FG'09 Proceedings of the 14th international conference on Formal grammar
On learning random DNF formulas under the uniform distribution
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Goals in the propositional horn⊃ language are monotone boolean circuits
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Three learnable models for the description of language
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Proceedings of the 15th International Conference on Database Theory
Polynomial time learning of some multiple context-free languages with a minimally adequate teacher
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
ACM Transactions on Database Systems (TODS) - Invited papers issue
Hi-index | 0.00 |