Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 189

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds

Fiorini, Samuel, Massar, Serge, Pokutta, Sebastian, Tiwary, Hans Raj, de Wolf, Ronald · 2012 · Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Abstract

We solve a 20-year old problem posed by Yannakakis and prove that there exists no polynomial-size linear program (LP) whose associated polytope projects to the traveling salesman polytope, even if the LP is not required to be symmetric. Moreover, we prove that this holds also for the cut polytope and the stable set polytope. These results were discovered through a new connection that we make between one-way quantum communication protocols and semidefinite programming reformulations of LPs.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2213977.2213988

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

Metadata

Authors
Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., & de Wolf, R.
Venue
Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Publisher
ACM
Published
2012-05-19
Pages
95-106
OpenAlex
W2119368733
Cited by
189
References
2
FWCI
28.96
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. https://app.cochat.ai/papers/10.1145/2213977.2213988
The paper
Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., & de Wolf, R. (2012). Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. Proceedings of the forty-fourth annual ACM symposium on Theory of computing. https://doi.org/10.1145/2213977.2213988

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.