S. Khanna, M. Sudan, L. Trevisan, and D. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6):1863--1920. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Quantified Constraint Satisfaction Problems: Closure Properties.. - Chen (2003) (Correct)
.... have been established, including dichotomies in the complexity of counting the number of satisfying assignments [9] finding the lexicographically minimum 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 ....
Sanjeev Khanna, Madhu Sudan, Luca Trevisan, and David P. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6):1863--1920.
SIGACT News Complexity Theory Column 34 - Hemaspaandra (Correct)
.... cation results become interesting in their own, and this motivated the study of Hunt et al. 10] as also the monograph by the authors [7] In fact, a tangential result along these lines shows how such reductions may even be found by an automated search (see Trevisan et al. 23] Khanna et al. [15] show how to use classi cation results to unify and extend many results in the study of the approximability of optimization problems. We will discuss these results in some detail shortly. First we introduce constraint satisfaction problems. 2 Constraint Satisfaction Problems We introduce ....
....notes that if F is 0 valid or 1 valid or bijunctive or ane or weakly positive or weakly negative then SAT(F) can be decided in polynomial time. The amazing theorem of Schaefer, is that for any family that does not fall in one of the above categories, the SAT(F) problem is hard 5 Khanna et al. [15] take a somewhat more stringent view on these indices and insist that i 1 ; i k should be distinct. This gives them a more re ned collection of problems with ability to separate e.g. the exact 3 sat problem from the 3 sat problem. Here we will allow i j s to be repeated. 4 Theorem 2.4 ....
[Article contains additional citation context not shown here]
Sanjeev Khanna, Madhu Sudan, Luca Trevisan, and David P. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing (SICOMP), Vol. 30, No. 6, pp. 1863-
The Complexity of Minimal Satisfiability Problems - Kirousis, Kolaitis (2001) (Correct)
....[JCG97] In recent years, researchers have obtained dichotomy theorems for optimization problems, counting problems, enumeration problems, and decision problems that are variants of Generalized Satisfiability problems. Speci cally, Creignou [Cre95] Khanna, Sudan, Trevisan and Williamson [KSTW01], and Zwick [Zwi98] obtained dichotomy theorems for certain classes of optimization problems related to propositional satis ability and Boolean constraint satisfaction; Creignou and Hermann [CH96] proved a dichotomy theorem for the class of counting problems that ask for the number of satisfying ....
S. Khanna, M. Sudan, L. Trevisan, and D.P. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6): 1863-
Energy Minimization via Graph Cuts: Settling What is Possible - Daniel Freedman And (1 citation) (Correct)
No context found.
S. Khanna, M. Sudan, L. Trevisan, and D. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6):1863--1920.
Optimization, Games, and Quantified Constraint Satisfaction - Chen, Pal (Correct)
No context found.
S. Khanna, M. Sudan, L. Trevisan and D.P. Williamson. The Approximability of Constraint Satisfaction Problems. SIAM Journal on Computing, 30:1863--1920, 2001.
Parameterized Complexity of Constraint Satisfaction Problems - Marx (2004) (Correct)
No context found.
S. Khanna,M.Sudan,L.Trevisan,andD.P.Williamson. The approximability of constraint satisfaction problems. SIAM J. Comput., 30(6):1863--1920.
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