Sanjeev Khanna, Madhu Sudan, Luca Trevisan, David P. Williamson  Home/Search
Context Related
| berkeley.edu/~luca/pubs/kstw.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: berkeley.edu/~luca/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study optimization problems that may be expressed as "Boolean constraint satisfaction problems". An instance of a Boolean constraint satisfaction problem is given by m constraints applied to n Boolean variables. Different computational problems arise from constraint satisfaction problems depending on the nature of the "underlying" constraints as well as on the goal of the computational task. Here we consider four possible goals: Max CSP (Min CSP) is the class of problems where the goal... (Update)
Similar documents based on text: More All
1.2: A Complete Classification of the Approximability of.. - Khanna, Sudan.. (1997) (Correct)
1.1: Constraint Satisfaction: The Approximability of.. - Khanna, Sudan, Trevisan (1997) (Correct)
0.8: The Approximability of Constraint Satisfaction Problems - Khanna, Sudan, Trevisan.. (2001) (Correct)
BibTeX entry: (Update)
S. Khanna, M. Sudan, L. Trevisan, and D.P. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6): 1863- http://citeseer.ist.psu.edu/article/khanna98approximability.html More
@article{ khanna00approximability,
author = "Sanjeev Khanna and Madhu Sudan and Luca Trevisan and David P. Williamson",
title = "The Approximability of Constraint Satisfaction Problems",
journal = "SIAM J. Comput.",
volume = "30",
number = "6",
pages = "1863-1920",
year = "2000",
url = "citeseer.ist.psu.edu/article/khanna98approximability.html" }
Citations (may not include all citations):4212 Computers and Intractability: a Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
415 Improved approximation algorithms for maximum cut and satisf.. - Goemans, Williamson - 1995
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1998
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1994
212 Probabilistic checking of proofs: A new characterization of .. - Arora, Safra - 1998
126 Efficient probabilistically checkable proofs and application.. - Bellare, Goldwasser et al. - 1993
120 The hardness of approximate optima in lattices (context) - Arora, Babai et al. - 1997
104 approximation and complexity classes (context) - Papadimitriou, Yannakakis - 1991
104 Approximating maximum independent sets by excluding subgraph.. - Boppana, Hald'orsson - 1992
95 A sub-constant error-probability low-degree test - Raz, Safra - 1997
94 the structure of polynomial time reducibility (context) - Ladner - 1975
94 Interactive proofs and the hardness of approximating cliques - Feige, Goldwasser et al. - 1996
85 the approximation of maximum satisfiability (context) - Yannakakis - 1994
83 On syntactic versus computational views of approximability - Khanna, Motwani et al. - 1994
82 Improved low degree testing and its applications - Arora, Sudan - 1997
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.berkeley.edu/~luca/papers.html): More
Recycling Queries in PCPs and in Linearity Tests (Extended.. - Trevisan (1998) (Correct)
Probabilistically Checkable Proofs with Low Amortized Query.. - Sudan, Trevisan (1998) (Correct)
On the Efficiency of Polynomial Time Approximation Schemes - Cesati, Trevisan (1997) (Correct)
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