A dichotomy theorem for learning quantified Boolean formulas
COLT '97 Proceedings of the tenth 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 34
ACM SIGACT News
Computational Complexity of Simultaneous Elementary Matching Problems
Journal of Automated Reasoning
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Complexity of Model Checking and Inference in Minimal Models
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Determining the Number of Solutions to Binary CSP Instances
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Boolean Formulas are Hard to Learn for most Gate Bases
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Dichotomy Theorem for the Generalized Unique Satisfiability Problem
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Information and Computation
The complexity of minimal satisfiability problems
Information and Computation
SIGACT news complexity theory column 43
ACM SIGACT News
On unique graph 3-colorability and parsimonious reductions in the plane
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
The Complexity of Boolean Constraint Satisfaction Local Search Problems
Annals of Mathematics and Artificial Intelligence
The complexity of counting homomorphisms seen from the other side
Theoretical Computer Science
The complexity of partition functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
The dichotomy of conjunctive queries on probabilistic structures
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Predecessor existence problems for finite discrete dynamical systems
Theoretical Computer Science
On counting homomorphisms to directed acyclic graphs
Journal of the ACM (JACM)
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Complexity of Counting the Optimal Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
A Computational Proof of Complexity of Some Restricted Counting Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Complexity of counting the optimal solutions
Theoretical Computer Science
The complexity of weighted Boolean #CSP with mixed signs
Theoretical Computer Science
Classification of a Class of Counting Problems Using Holographic Reductions
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Algorithms for propositional model counting
Journal of Discrete Algorithms
Enumerating all solutions for constraint satisfaction problems
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An approximation trichotomy for Boolean #CSP
Journal of Computer and System Sciences
On the boolean connectivity problem for horn relations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
ACM Transactions on Computational Logic (TOCL)
Proceedings of the forty-second ACM symposium on Theory of computing
Computing query probability with incidence algebras
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Boolean connectivity problem for Horn relations
Discrete Applied Mathematics
Holographic reduction: a domain changed application and its partial converse theorems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A trichotomy theorem for the approximate counting of complex-weighted bounded-degree boolean CSPs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Approximate counting for complex-weighted Boolean constraint satisfaction problems
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
A computational proof of complexity of some restricted counting problems
Theoretical Computer Science
Unique perfect phylogeny is NP-hard
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
The complexity of symmetric Boolean parity Holant problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An algebraic approach to the complexity of generalized conjunctive queries
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
The complexity of weighted and unweighted #CSP
Journal of Computer and System Sciences
Dichotomy for Holant problems of Boolean domain
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The connectivity of boolean satisfiability: computational and structural dichotomies
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Systems of equations over finite semigroups and the #CSP dichotomy conjecture
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
Theoretical Computer Science
Approximate counting for complex-weighted Boolean constraint satisfaction problems
Information and Computation
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
Theoretical Computer Science
The dichotomy of probabilistic inference for unions of conjunctive queries
Journal of the ACM (JACM)
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Unique perfect phylogeny is intractable
Theoretical Computer Science
Tractable counting of the answers to conjunctive queries
Journal of Computer and System Sciences
A complete dichotomy rises from the capture of vanishing signatures: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
An algebraic characterization of testable boolean CSPs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
The complexity of complex weighted Boolean #CSP
Journal of Computer and System Sciences
| Hi-index | 0.01 |