Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR99-039 | 24th September 1999 00:00

On approximating CSP-B

RSS-Feed




TR99-039
Authors: Johan Hastad
Publication: 27th September 1999 14:07
Downloads: 1255
Keywords: 


Abstract:

We prove that any constraint satisfaction problem
where each variable appears a bounded number of
times admits a nontrivial polynomial time approximation
algorithm.



ISSN 1433-8092 | Imprint