The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Linear Level Lasserre Lower Bounds for Certain k-CSPs
Abstract
We show that for kges3 even the Omega(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example k-SAT or k-XOR. (One constant is said to imply another if the latter is true whenever the former is. For example k-XOR constraints imply k-CNF constraints.) As a result the Omega(n) level Lasserre relaxation fails to approximate such CSPs betterthan the trivial, random algorithm. As corollaries, we obtain Omega(n) level integrality gaps for the Lasserre hierarchy of 7/6-epsiv for VERTEXCOVER, 2-epsiv for k-UNIFORMHYPERGRAPHVERTEXCOVER, and any constant for k-UNIFORMHYPERGRAPHINDEPENDENTSET. This is the first construction of a Lasserre integrality gap.Our construction is notable for its simplicity. It simplifies, strengthens, and helps to explain several previous results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Cones of Matrices and Set-Functions and 0–1 Optimization
Lovász, L., & Schrijver, A. (1991) · SIAM Journal on Optimization · doi:10.1137/0801013 · Cited by 1,008
Sherali, H. D., & Adams, W. P. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403036 · Cited by 931
Short proofs are narrow—resolution made simple
Ben‐Sasson, E., & Wigderson, A. (2001) · Journal of the ACM · doi:10.1145/375827.375835 · Cited by 422
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
Laurent, M. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.3.470.16391 · Cited by 373
Zwick, U. (1998) · doi:10.5555/314613.314701 · Cited by 143
Integrality gaps for Sherali-Adams relaxations
Charikar, M., Makarychev, K., & Makarychev, Y. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536455 · Cited by 112
Linear programming relaxations of maxcut
de la Véga, W. F., & Mathieu, C. (2007) · doi:10.5555/1283383.1283390 · Cited by 81
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
Schoenebeck, G. R., Trevisan, L., & Tulsiani, M. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250836 · Cited by 72
Self-citationThe Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
Kleinberg, J. M., & Goemans, M. X. (1998) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480195287541 · Cited by 63
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Alekhnovich, M., Arora, S., & Tourlakis, I. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060634 · Cited by 55
Rank bounds and integrality gaps for cutting planes procedures
Buresh-Oppenheim, J., Galesi, N., Hoory, S., Magen, A., & Pitassi, T. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238206 · Cited by 54
Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations
Chlamtáč, E. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.72 · Cited by 44
On semidefinite programming relaxations for graph coloring and vertex cover
Charikar, M. (2002) · doi:10.5555/545381.545462 · Cited by 41
Cited by
An Introduction to Polynomial and Semi-Algebraic Optimization
Lasserre, J. B. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9781107447226 · Cited by 260
Challenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201
Metadata
- Authors
- Schoenebeck, G.
- Venue
- 2008 49th Annual IEEE Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 2008-10
- Pages
- 593-602
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2107052785
- Cited by
- 261
- References
- 13
- FWCI
- 10.78
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.