On the extension complexity of combinatorial polytopes (Q745682): Difference between revisions

From MaRDI portal
Merged Item from Q5326550
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Two-party Bell inequalities derived from combinatorics via triangular elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating facets for the cut polytope of a graph by triangular elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem on graphs not contractible to \(K_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Quantum Query and Communication Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear vs. semidefinite extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the extension complexity of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Revision as of 21:16, 10 July 2024

scientific article; zbMATH DE number 6195414
  • On the Extension Complexity of Combinatorial Polytopes
Language Label Description Also known as
English
On the extension complexity of combinatorial polytopes
scientific article; zbMATH DE number 6195414
  • On the Extension Complexity of Combinatorial Polytopes

Statements

On the extension complexity of combinatorial polytopes (English)
0 references
On the Extension Complexity of Combinatorial Polytopes (English)
0 references
0 references
0 references
14 October 2015
0 references
6 August 2013
0 references
extension complexity
0 references
cut polytope
0 references
graph minors
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references