Paper proves O(k log n log log n) directions determine point multisets in any dimension
Theoretical result shows nearly logarithmic projections suffice to uniquely determine multisets of n points in k dimensions.
Stories per day · 30 days
Relatedalgorithms1complexity1computational-geometry1directional-projections1fixed-points1point-sets1projections1stochastic-games1
3 stories, newest first · one card per story
Stories tagged #theoretical-cs
Quasipolynomial algorithm finds approximate fixed points of ℓ∞ contractions
The method geometrically shrinks the search region and implies simple stochastic games can be solved in quasipolynomial time.
A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model
Researchers prove nearly quadratic lower bounds for linear optimization over convex bodies in the membership oracle model.