TY - GEN
T1 - Subexponential bound for linear programming
AU - Matousek, Jiri
AU - Sharir, Micha
AU - Welzl, Emo
PY - 1992
Y1 - 1992
N2 - We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected O(nde4√dln(n+1)) time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input). The expectation is over the internal randomizations performed by the algorithm, and holds for any input. The algorithm is presented in an abstract framework, which facilitates its application to several other related problems. The algorithm has been presented in a previous work by the authors [ShW], but its analysis and the subexponential complexity bound are new.
AB - We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected O(nde4√dln(n+1)) time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input). The expectation is over the internal randomizations performed by the algorithm, and holds for any input. The algorithm is presented in an abstract framework, which facilitates its application to several other related problems. The algorithm has been presented in a previous work by the authors [ShW], but its analysis and the subexponential complexity bound are new.
UR - http://www.scopus.com/inward/record.url?scp=0026976789&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0026976789
SN - 0897915178
T3 - Eighth Annual Symposium On Computational Geometry
SP - 1
EP - 8
BT - Eighth Annual Symposium On Computational Geometry
PB - Association for Computing Machinery (ACM)
T2 - Eighth Annual Symposium On Computational Geometry
Y2 - 10 June 1992 through 12 June 1992
ER -