N. Creignou, S. Khanna, and M. Sudan. Complexity classifications of Boolean constraint satisfaction problems. Monographs on Discrete Applied Mathematics, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Quantified Constraint Satisfaction Problems: Closure Properties.. - Chen (2003) (Correct)
....way is to restrict the constraint language, or the types of constraints that are permitted in instances. This is the form of restriction which was studied by Schaefer in his now classic dichotomy theorem [27] and has seen intense investigation over the past decade in several different contexts [10]. In this paper, we study the complexity of the QCSP from the standpoint of restricting the constraint language. Our main contribution is the identification of three broad tractable subclasses of the QCSP. 1.1 Background In [27] Schaefer proved a dichotomy theorem on the complexity of CSP, ....
....satisfying assignment [26] inverse satisfiability [20] and finding a satisfying assignment maximizing the number of satisfied constraints [21] All of these dichotomy theorems are for constraint languages over a two element domain. Particularly relevant here is the dichotomy theorem for QCSP [10, 11] (also for two element domains) which shows that the only tractable subclasses in this context are QUANTIFIED 2 SAT [1] QUANTIFIED HORN SAT [8] and QUANTIFIED XOR SAT [10] reflecting exactly the nontrivial tractable subclasses of CSP given by Schaefer s theorem. All other constraint languages ....
[Article contains additional citation context not shown here]
Nadia Creignou, Sanjeev Khanna, and Madhu Sudan. Complexity Classification of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, 2001.
Generic ILP versus Specialized 0-1 ILP: An Update - Aloul, Ramani, Markov, Sakallah (2002) (5 citations) (Correct)
....CNF clause (Xl x2 xk ) is equivalent to the PB con straint x x2 . xk 1. PB constraints are more expressive, however; a single PB constraint may in some cases correspond to an exponential number of CNF clauses. Common examples of 0 1 ILPs include Min COVER [9] Max SAT and Max ONEs [6]. In Min COVER, we have a collection of subsets of a given set and seek to find a cover of the set using the fewest number of subsets. Logic minimization of Boolean functions as well as state minimization of finite state machines are two important instances of this problem. In the Max SAT problem, ....
N. Creignou, S. Kanna, and M. Sudan, "Complexity Classifications of Boolean Constraint Satisfaction Problems ", Society for Industrial and Applied Mathematics (SIAM), 2001.
Locally Testable Codes and PCPs of almost-Linear Length - Goldreich, Sudan (2004) (3 citations) Self-citation (Sudan) (Correct)
No context found.
N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Press, Philadeplhia, PA, USA, March 2001.
Locally Testable Codes and PCPs of Almost-Linear Length - Preliminary Version Oded Self-citation (Sudan) (Correct)
No context found.
N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Press, Philadeplhia, PA, USA, March 2001.
Locally Testable Codes and PCPs of Almost-Linear Length - Goldreich, Sudan (2002) (3 citations) Self-citation (Sudan) (Correct)
No context found.
N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Press, Philadeplhia, PA, USA, March 2001.
Random Generalized Satisfiability Problems - Creignou, Daudé (2002) Self-citation (Creignou) (Correct)
....is fixed. Informally speaking, each problem in this class is characterized by a finite collection of finitely specified constraint templates, say F. This class of problems, SAT(F) could be interpreted to be the combinatorial core of complexity and has already been thoroughly tested (see [CKS01] for a survey) as a testbed for abstracting global inferences about the nature of computation. Therefore this class might also provide some hints on the nature of phase transitions. In Section 2.1 we propose a general framework to make precise the universe set on which probability can be done, ....
N. Creignou, S. Khanna and M. Sudan. Complexity classifications of Boolean constraint satisfaction problems. SIAM Monographs on discrete mathematics and applications, 2001.
Fixed-Parameter Hierarchies inside PSPACE - Guoqiang Pan Department (Correct)
No context found.
N. Creignou, S. Khanna, and M. Sudan. Complexity classifications of Boolean constraint satisfaction problems. Monographs on Discrete Applied Mathematics, 2001.
Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms - Chen (Correct)
No context found.
Nadia Creignou, Sanjeev Khanna, and Madhu Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications 7, 2001.
Optimization, Games, and Quantified Constraint Satisfaction - Chen, Pal (Correct)
No context found.
Nadia Creignou, Sanjeev Khanna, Madhu Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, 2001.
Algorithms for Quantified Constraint Satisfaction Problems - Nikos Mamoulis Department (2004) (1 citation) (Correct)
No context found.
Creignou, N.; Khanna, S.; and M., S., eds. 2001. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs in Discrete Mathematis and Applications.
Looking Algebraically at Tractable Quantified Boolean Formulas - Chen, Dalmau (Correct)
No context found.
Nadia Creignou, Sanjeev Khanna, and Madhu Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications 7, 2001.
Periodic Constraint Satisfaction Problems: Polynomial-Time.. - Chen (Correct)
No context found.
Nadia Creignou, Sanjeev Khanna, and Madhu Sudan. Complexity Classification of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, 2001.
Inverse Circumscription - Chen (Correct)
No context found.
Nadia Creignou, Sanjeev Khanna, and Madhu Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, SIAM, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC