STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A dichotomy theorem for learning quantified Boolean formulas
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Recycling queries in PCPs and in linearity tests (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Dichotomy Theorem for Learning Quantified Boolean Formulas
Machine Learning - Special issue: computational learning theory, COLT '97
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Information and Computation
SIGACT news complexity theory column 34
ACM SIGACT News
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
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
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
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
The Complexity of Boolean Constraint Satisfaction Local Search Problems
Annals of Mathematics and Artificial Intelligence
Every 2-CSP allows nontrivial approximation
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
The complexity of soft constraint satisfaction
Artificial Intelligence
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science
Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights
Journal of Computer and System Sciences
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM (JACM)
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
Conditional hardness for satisfiable 3-CSPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
The complexity of soft constraint satisfaction
Artificial Intelligence
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
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)
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
An algebraic theory of complexity for valued constraints: establishing a Galois connection
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
An algebraic characterisation of complexity for valued constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
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
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
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A dichotomy theorem for typed constraint satisfaction problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Optimization, randomized approximability, and boolean constraint satisfaction problems
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On the complexity of submodular function minimisation on diamonds
Discrete Optimization
Linear-programming design and analysis of fast algorithms for Max 2-CSP
Discrete Optimization
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
The complexity of finite-valued CSPs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |