Login / Signup

Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity.

Sally DongThomas Rothvoss
Published in: CoRR (2023)
Keyphrases
  • linear complexity
  • computational complexity
  • worst case
  • exponential size
  • real time
  • bayesian networks
  • upper bound
  • convex hull
  • covariance matrices
  • lattice points
  • average case complexity