共 50 条
- [36] Optimal Bound on the Combinatorial Complexity of Approximating Polytopes PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 786 - 805
- [38] Combinatorial Bernoulli Factories: Matchings, Flows, and Other Polytopes STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 833 - 846
- [39] On Vertices and Facets of Combinatorial 2-Level Polytopes COMBINATORIAL OPTIMIZATION, ISCO 2016, 2016, 9849 : 177 - 188