The Matching Polytope has Exponential Extension Complexity (Q4640350): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+The matching polytope has exponential extension complexity
@@ description / en / description / en @@
-scientific article; zbMATH DE number 6869511
+scientific article; zbMATH DE number 6451554
@@ Property / title @@
+The matching polytope has exponential extension complexity (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.90038
@@ Property / zbMATH Open document ID: 1315.90038 / rank @@
+Normal rank
@@ Property / DOI @@
+.1145/2591796.2591834
@@ Property / DOI: 10.1145/2591796.2591834 / rank @@
+Normal rank
@@ Property / published in @@
+Proceedings of the forty-sixth annual ACM symposium on Theory of computing
+Normal rank
@@ Property / publication date @@
+June 2015Timestamp +2015-06-26T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2015-06-26T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 26 June 2015 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 90C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6451554
@@ Property / zbMATH DE Number: 6451554 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial optimization
@@ Property / zbMATH Keywords: combinatorial optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+linear programming relaxations
@@ Property / zbMATH Keywords: linear programming relaxations / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polytopes
@@ Property / zbMATH Keywords: polytopes / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2759253428
@@ Property / OpenAlex ID: W2759253428 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2033871299
@@ Property / OpenAlex ID: W2033871299 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q115522540
@@ Property / Wikidata QID: Q115522540 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2369
@@ Property / arXiv ID: 1311.2369 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SuLQ
@@ Property / describes a project that uses: SuLQ / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the Sample Complexity for Private Learning and Private Data Release
+Normal rank
@@ Property / cites work @@
+Characterizing the sample complexity of private learners
+Normal rank
@@ Property / cites work @@
+Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
+Normal rank
@@ Property / cites work @@
+Q5302085
@@ Property / cites work: Q5302085 / rank @@
+Normal rank
@@ Property / cites work @@
+Collusion-secure fingerprinting for digital data
@@ Property / cites work: Collusion-secure fingerprinting for digital data / rank @@
+Normal rank
@@ Property / cites work @@
+Faster private release of marginals on small databases
+Normal rank
@@ Property / cites work @@
+Lower Bounds in Differential Privacy
@@ Property / cites work: Lower Bounds in Differential Privacy / rank @@
+Normal rank
@@ Property / cites work @@
+Our Data, Ourselves: Privacy Via Distributed Noise Generation
+Normal rank
@@ Property / cites work @@
+Theory of Cryptography
@@ Property / cites work: Theory of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549600
@@ Property / cites work: Q3549600 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of differentially private data release
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for privately releasing marginals via convex relaxations
+Normal rank
@@ Property / cites work @@
+Advances in Cryptology – CRYPTO 2004
@@ Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+New Efficient Attacks on Statistical Disclosure Control Mechanisms
+Normal rank
@@ Property / cites work @@
+Privately Releasing Conjunctions and the Statistical Query Barrier
+Normal rank
@@ Property / cites work @@
+Iterative Constructions and Private Data Release
@@ Property / cites work: Iterative Constructions and Private Data Release / rank @@
+Normal rank
@@ Property / cites work @@
+On the geometry of differential privacy
@@ Property / cites work: On the geometry of differential privacy / rank @@
+Normal rank
@@ Property / cites work @@
+The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
+Normal rank
@@ Property / cites work @@
+The Geometry of Differential Privacy: The Small Database and Approximate Cases
+Normal rank
@@ Property / cites work @@
+Differential Privacy and the Fat-Shattering Dimension of Linear Queries
+Normal rank
@@ Property / cites work @@
+Interactive privacy via the median mechanism
@@ Property / cites work: Interactive privacy via the median mechanism / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algorithms for Privately Releasing Marginals
+Normal rank
@@ Property / cites work @@
+Answering n             <sub>{2+o(1)}</sub>             counting queries with differential privacy is hard
+Normal rank

Latest revision as of 09:41, 10 July 2024

scientific article; zbMATH DE number 6451554

The matching polytope has exponential extension complexity

Language	Label	Description	Also known as
English	The Matching Polytope has Exponential Extension Complexity	scientific article; zbMATH DE number 6451554	The matching polytope has exponential extension complexity