Is constraint satisfaction over two variables always easy?-Reference-Cited by-同舟云学术

Is constraint satisfaction over two variables always easy?

Published:2004 Issue:2 Volume:25 Page:150-178
ISSN:1042-9832
Container-title:Random Structures and Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Engebretsen Lars,Guruswami Venkatesan

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference20 articles.

1. An approximation algorithm for max p-section, Proc 16th Ann Symp Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1563, Trier, 4-6 March 1999, pp. 237-247.

2. Some new randomized approximation algorithms, Doctoral dissertation, Department of Numerical Analysis and Computer Science, Royal Institute of Technology, May 2000.

3. A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p

4. Proof verification and the hardness of approximation problems

5. On Weighted vs Unweighted Versions of Combinatorial Optimization Problems

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximation Resistance from Pairwise-Independent Subgroups;Journal of the ACM;2016-09

2. Approximating Bounded Occurrence Ordering CSPs;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2012

3. Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant;SIAM Journal on Computing;2011-01

4. Every Permutation CSP of arity 3 is Approximation Resistant;2009 24th Annual IEEE Conference on Computational Complexity;2009-07

5. Every 2-csp Allows Nontrivial Approximation;computational complexity;2008-11-19