Approximating minimum unsatisfiability of linear equations

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 514-516

  Berman, Piotr ^a,b   Karpinski, Marek ^a  

^a UNIVERSITY OF BONN   (Germany)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; LINEAR EQUATIONS; OPTIMIZATION;

APPROXIMATION RATIOS; FEASIBLE SOLUTION; NEAREST CODEWORD PROBLEMS; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; SYSTEMS OF LINEAR EQUATIONS;

POLYNOMIAL APPROXIMATION;

EID: 84968835314     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. [ABSS93] S. Arora, L. Babai, J. Stern and Z. Sweedyk, The hardness of approximate optima in lattice, codes, and systems of linear equations, Proc. of 34tb IEEE FOCS, 1993, 724-733.
2. [BFKOO] C. Bazgan, W. Fernandez de la Vega and M. Karpinski, Approximability of dense instances of NEAREST CODEWORD problem, ECCC Tech. Rep. TROO-091, 2000.
3. [BK01] P. Berman and M. Karpinski, Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION, ECCC Tech. Rep. TR01-026, 2001.
4. [DKS98] I. Dinur, G. Kindler and S. Safra, Approximating CVP to within almost polynomial factors is NP-hard, Proc. of 39th IEEE FOCS, 1998, 90-109.
5. [DKRS00] I. Dinur, G. Kindler, R. Raz and S. Safra, An improved lower bound for approximating CVP, 2000, submitted.
6. [K01] R. Kannan, personal communication (see also [ABSS93], p. 725).
7. [KST97] S. Khanna, M. Sudan and L. Trevisan, Constraint Satisfaction: the approximability of minimization problems, Proc. of 12th IEEE Computational Complexity, 1997, 282-296.