A Subexponential Bound for Linear Programming
- 期刊名称Algorithmica
- 作者Matousek, M. Sharir, E. Welzl, J.
- 卷第16卷
- 印刷ISSN0178-4617
- 电子ISSN1432-0541
- 文件大小128.87KB
- 发表时间1996-4-1
- DOI10.1007/s004539900062
- 页码498-516
同期刊推荐
Dynamic programming and convex clusteringVladimir Batagelj; Simona Korenjak-Černe; Sandi Klavžar · Algorithmica · 1994
Variations on ray shootingReuven Bar-Yehuda; Sergio Fogel · Algorithmica · 1994
Planar geometric location problemsPankaj K. Agarwal; Micha Sharir · Algorithmica · 1994
Guest editor's introductionJ. S. Vitter · Algorithmica · 1994
Checking the correctness of memoriesM. Blum; W. Evans; P. Gemmell; S. Kannan; M. Naor · Algorithmica · 1994
Packet routing on grids of processorsManfred Kunde · Algorithmica · 1993
On Boyer-Moore automataR. A. Baeza-Yates; C. Choffrut; G. H. Gonnet · Algorithmica · 1994
Parametric optimization of sequence alignmentD. Gusfield; K. Balasubramanian; D. Naor · Algorithmica · 1994