10 citations · 25 across the 10 of their papers we have counts for
1 paper · 2 filters
Simon Weber, Bernd Gärtner
The Matoušek LP-type problems were used by Matoušek to show that the Sharir-Welzl algorithm may require at least subexponential time. Later, Gärtner translated this result into the…