Communications of the ACM
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Learning Conjunctions of Horn Clauses
Machine Learning - Computational learning theory
Linear time deterministic learning of k-term DNF
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
On learning counting functions with queries
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
When won't membership queries help?
Selected papers of the 23rd annual ACM symposium on Theory of computing
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Complexity of generalized satisfiability counting problems
Information and Computation
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Machine Learning
Machine Learning
The Inverse Satisfiability Problem
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Learnability of Quantified Formulas
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
| Hi-index | 0.00 |