A new way to use semidefinite programming with applications to linear equations mod p

Authors:
Gunnar Andersson;Lars Engebretsen;Johan Håstad
Affiliations:
Royal Institute of Technology, SE-100 44 Stockholm, Sweden;Royal Institute of Technology, SE-100 44 Stockholm, Sweden;Royal Institute of Technology, SE-100 44 Stockholm, Sweden
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Citing 2
Cited 2

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Some optimal inapproximability results

Journal of the ACM (JACM)
An approximation algorithm for max p-section

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract