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

← Older edit Newer edit →

@@ aliases / en / 0 / aliases / en / 0 @@
+On the Extension Complexity of Combinatorial Polytopes
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6195414
@@ Property / title @@
+On the Extension Complexity of Combinatorial Polytopes (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68112
@@ Property / zbMATH Open document ID: 1336.68112 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-39206-1_6
@@ Property / DOI: 10.1007/978-3-642-39206-1_6 / rank @@
+Normal rank
@@ Property / published in @@
+Automata, Languages, and Programming
@@ Property / published in: Automata, Languages, and Programming / rank @@
+Normal rank
@@ Property / publication date @@
+August 2013Timestamp +2013-08-06T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2013-08-06T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 6 August 2013 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C57
@@ Property / Mathematics Subject Classification ID: 90C57 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6195414
@@ Property / zbMATH DE Number: 6195414 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1942134738
@@ Property / OpenAlex ID: W1942134738 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2568023417
@@ Property / OpenAlex ID: W2568023417 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2340
@@ Property / arXiv ID: 1302.2340 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-party Bell inequalities derived from combinatorics via triangular elimination
+Normal rank
@@ Property / cites work @@
+Generating facets for the cut polytope of a graph by triangular elimination
+Normal rank
@@ Property / cites work @@
+The max-cut problem on graphs not contractible to \(K_ 5\)
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Quantum Query and Communication Complexities
+Normal rank
@@ Property / cites work @@
+Geometry of cuts and metrics
@@ Property / cites work: Geometry of cuts and metrics / rank @@
+Normal rank
@@ Property / cites work @@
+Linear vs. semidefinite extended formulations
@@ Property / cites work: Linear vs. semidefinite extended formulations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the extension complexity of the knapsack polytope
+Normal rank
@@ Property / cites work @@
+On the distributional complexity of disjointness
@@ Property / cites work: On the distributional complexity of disjointness / rank @@
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank
@@ Property / cites work @@
+Lectures on Polytopes
@@ 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