A new lazy-update algorithm claims near-linear O(ε^{-1}nd log(n/d)) time for approximate John ellipsoids, but key proof steps and complexity accounting contain gaps.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
John Ellipsoids via Lazy Updates
A new lazy-update algorithm claims near-linear O(ε^{-1}nd log(n/d)) time for approximate John ellipsoids, but key proof steps and complexity accounting contain gaps.