|
|||||
|
|
Some lower bounds for the complexity of the linear programming feasibility problem over the reals |
|
| Authors: | Rafael Grimson Bart Kuijpers |
| Institution: | 1. Theoretical Computer Science Group, Hasselt University and Transnational University of Limburg, Belgium;2. Departamento de Matemática, Universidad de Buenos Aires, Argentina |
| Abstract: | |
| Keywords: | Lower bounds Linear programming Algebraic complexity Limiting hypersurface Elimination theory |
| 本文献已被 ScienceDirect 等数据库收录！ | |