A new multipass linear sketching framework approximates LP-type problems in low dimension with poly(d, log(1/eps)) space, plus claimed 1-pass lower bounds for MEB and linear SVM.
Sublinear time algorithms for approximate semidefinite programming
1 Pith paper cite this work, alongside 13 external citations. Polarity classification is still indexing.
1
Pith paper citing it
13
external citations · OpenAlex
citation-role summary
other 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Multipass Linear Sketches for Geometric LP-Type Problems
A new multipass linear sketching framework approximates LP-type problems in low dimension with poly(d, log(1/eps)) space, plus claimed 1-pass lower bounds for MEB and linear SVM.