New way to use semidefinite programming with applications to linear equations mod p

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages 41-50

  Andersson, Gunnar ^a   Engebretsen, Lars ^a   Hastad, Johan ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; LINEAR EQUATIONS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING;

SEMIDEFINITE PROGRAMMING;

ALGORITHMS;

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

References (4)