Year: 1990
Type: conference-paper
Abstract: We present two randomized algorithms. One solves linear programs involving m constraints in d variables in expected time Ο(m). The other constructs convex hulls of n points in Rd, d > 3, in expected time Ο(n⌈d/2⌉). In both bounds d is considered to be a constant. In the linear programming algorithm the dependence of the time bound on d is of the form d!. The main virtue of our results lies in the utter simplicity of the algorithms as well as their analyses.
DOI: 10.1145/98524.98570
Author: Raimund Seidel
Institution: University of California, Berkeley
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2158130976
