Data mining, hypergraph transversals, and machine learning (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Generating all maximal independent sets of bounded-degree hypergraphs
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A New Model of Computation for Learning Vision Modules from Examples
Journal of Mathematical Imaging and Vision
SIGACT News complexity theory column 32
ACM SIGACT News
Separating Quantum and Classical Learning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Learning Expressions over Monoids
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Learning Concept Classes with Polynomial General Dimension
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Uniform Characterizations of Polynomial-Query Learnabilities
DS '98 Proceedings of the First International Conference on Discovery Science
On the Proper Learning of Axis Parallel Concepts
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Uniform characterizations of polynomial-query learnabilities
Theoretical Computer Science
Learning from examples with unspecified attribute values
Information and Computation
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the proper learning of axis-parallel concepts
The Journal of Machine Learning Research
Average-case intractability vs. worst-case intractability
Information and Computation
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Improved Bounds on Quantum Learning Algorithms
Quantum Information Processing
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
Journal of Computer and System Sciences
Circuit lower bounds for Merlin-Arthur classes
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
Proving SAT does not have small circuits with an application to the two queries problem
Journal of Computer and System Sciences
Parameterized Learnability of k-Juntas and Related Problems
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Query Learning and Certificates in Lattices
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
ACM SIGACT News
Parameterized learnability of juntas
Theoretical Computer Science
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Learning expressions and programs over monoids
Information and Computation
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
A bibliographical study of grammatical inference
Pattern Recognition
On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Super-polynomial versus half-exponential circuit size in the exponential hierarchy
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
The 1-versus-2 queries problem revisited
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A full characterization of quantum advice
Proceedings of the forty-second ACM symposium on Theory of computing
Computing minimal models by positively minimal disjuncts
JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence
Zulu: an interactive learning competition
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
On exact learning halfspaces with random consistent hypothesis oracle
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Some results on average-case hardness within the polynomial hierarchy
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Optimization problems in the polynomial-time hierarchy
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Regular languages, unambiguous concatenation and computational complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Hardness hypotheses, derandomization, and circuit complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |