14 citations · 35 across the 7 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.SC2015★ 2 cited
On the robust hardness of Gröbner basis computation
Gwen Spencer, David Rolnick
The computation of Gröbner bases is an established hard problem. By contrast with many other problems, however, there has been little investigation of whether this hardness is robu…
math.MG2015★ 14 cited
Quantitative Tverberg, Helly, & Carathéodory theorems
J. A. De Loera, R. N. La Haye, D. Rolnick +1
This paper presents sixteen quantitative versions of the classic Tverberg, Helly, & Caratheodory theorems in combinatorial convexity. Our results include measurable or enumerable i…
math.MG2015★ 9 cited
Quantitative theorems in combinatorial geometry
David Rolnick, Pablo Soberón
We show quantitative versions of classic results in discrete geometry, where the size of a convex set is determined by some non-negative function. We give versions of this kind for…