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
Closure properties of constraints
Journal of the ACM (JACM)
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
The Inverse Satisfiability Problem
SIAM Journal on Computing
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Gadgets, Approximation, and Linear Programming
SIAM Journal on Computing
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
An Algebraic Model for Combinatorial Problems
SIAM Journal on Computing
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
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
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The Optimization Complexity of Constraint Satisfaction Problems
The Optimization Complexity of Constraint Satisfaction Problems
| Hi-index | 0.00 |
This issue's guest columnists are angels. The column was faced with a last-minute cancellation, and they prepared on very short notice a wonderful column. And I'm sure that many readers of the column will want to learn even more by, for example, reading their monograph Complexity Classifications of Boolean Constraint Satisfaction Problems [7].Future complexity columns include Holzer/McKenzie on a familiar complexity class turning up in a surprising context, Gasarch (and a host of contributors) on the future of NP, Schaeffer/Umans on completeness for higher levels of the polynomial hierarchy, Nickelsen/Tantau on partial information classes, and Paturi on the complexity of k-SAT,Regarding the Schaeffer/Umans column, their 2-part column will be in part a kind of Garey and Johnson for completeness results for ∑ip and πip, i ≥ 2. You can help their project by, if you have proven natural sets complete for NPNP, coNPNP, NPNPNP, coNPNPNP, etc., letting them (MSchaefer@cti.depaul.edu and umans@microsoft.com) know of your result and its best citation location. Thanks!