52 citations · 131 across the 29 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013★ 2 cited
A Deterministic Polynomial Space Construction for eps-nets under any Norm
Daniel Dadush
We give a deterministic polynomial space construction for nearly optimal eps-nets with respect to any input n-dimensional convex body K and norm |.|. More precisely, our algorithm…
cs.CC2013★ 20 cited
On the existence of 0/1 polytopes with high semidefinite extension complexity
Jop Briët, Daniel Dadush, Sebastian Pokutta
In Rothvoß it was shown that there exists a 0/1 polytope (a polytope whose vertices are in \{0,1\}^{n}) such that any higher-dimensional polytope projecting to it must have 2^{Ω(n)…