Optimal Bound on the Combinatorial Complexity of Approximating Polytopes

doi 10.1137/1.9781611975994.48
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

On the Complexity of Approximating a Nash Equilibrium

ACM Transactions on Algorithms
Mathematics
2013English

On the Linear Extension Complexity of Stable Set Polytopes for Perfect Graphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

Lower Bound Theorems for General Polytopes

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

On the Complexity of Optimal Homotopies

2018English

On the Complexity of Computing an Equilibrium in Combinatorial Auctions

2014English

The Lower and Upper Bound Problems for Cubical Polytopes

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1993English

Combinatorial Interpretation of Kolmogorov Complexity

English

The Complexity of Integer Bound Propagation

Journal of Artificial Intelligence Research
Artificial Intelligence
2011English

Approximating Optimal Binary Decision Trees

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy