CSR 2007 - PDF Preprint Papers

CSR 2007 International Computer Science Symposium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CSR-2007 Paper

click to vote

CSR
2007
Springer

166views Theoretical Computer Science» more CSR 2007»

Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems

13 years 11 months ago

Download www.ccs.neu.edu

The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a ﬁnite collection of constraints on a set of variables, and the goal...

Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	166	Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems	claim
2	164	Marrying Words and Trees	claim
3	134	New Bounds for MAX-SAT by Clause Learning	claim
4	120	Estimation of the Click Volume by Large Scale Regression Analysis	claim
5	117	Nash equilibrium and economics: Remarks	claim
6	116	On the Complexity of Matrix Rank and Rigidity	claim
7	114	Maximal Intersection Queries in Randomized Graph Models	claim
8	108	Planarity, Determinants, Permanents, and (Unique) Matchings	claim
9	106	Combinatorial and computational aspects of graph packing and graph decomposition	claim
10	103	Efficient Computation in Groups Via Compression	claim
11	103	The Limits of Quantum Computers	claim
12	100	Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth	claim
13	98	Equivalence Problems for Circuits over Sets of Natural Numbers	claim
14	98	Inverting Onto Functions and Polynomial Hierarchy	claim
15	98	Sequences of Level 1, 2, 3, ..., k , ..	claim
16	95	Proving Church's Thesis	claim
17	95	Pushing Random Walk Beyond Golden Ratio	claim
18	94	Decidability of Parameterized Probabilistic Information Flow	claim
19	94	On Empirical Meaning of Randomness with Respect to a Real Parameter	claim
20	90	Reminiscences related to graph theory	claim
21	89	Recent development in computational complexity characterization of Nash equilibrium	claim
22	88	A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes	claim
23	86	Understanding motion planning better: A comparative review of "Principles of Robot Motion: Theory, Algorithms, and Implementations", by H. Choset et al	claim
24	86	Sampling-based robot motion planning: Towards realistic applications	claim
25	85	Symmetry of Information and Nonuniform Lower Bounds	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers