A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p
From MaRDI portal
Publication:2729649
DOI10.1006/jagm.2000.1154zbMath1103.90385OpenAlexW2027020884WikidataQ56958995 ScholiaQ56958995MaRDI QIDQ2729649
Gunnar Andersson, Lars Engebretsen, Johan T. Håstad
Publication date: 10 December 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2000.1154
Semidefinite programming (90C22) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming ⋮ An extension of the angular synchronization problem to the heterogeneous setting ⋮ Approximation algorithms on \(k\)-correlation clustering ⋮ Approximating the 2-catalog segmentation problem using semidefinite programming relaxations ⋮ Computational topology and the Unique Games Conjecture ⋮ A combinatorial algorithm for MAX CSP ⋮ Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem
This page was built for publication: A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p
