Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
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)
Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Approximation Algorithms for the Maximum Satisfiability Problem
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
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
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
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
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximating the domatic number
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Random sampling and approximation of MAX-CSP problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Information and Computation
SIGACT news complexity theory column 34
ACM SIGACT News
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science - Complexity and logic
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
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
Inapproximability results for set splitting and satisfiability problems with no mixed clauses
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Boolean Formulas are Hard to Learn for most Gate Bases
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Information and Computation
SIGACT news complexity theory column 43
ACM SIGACT News
New hardness results for congestion minimization and machine scheduling
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Proceedings of the 11th ACM conference on Electronic commerce
Enumerating all solutions of a boolean CSP by non-decreasing weight
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |