|
|||||
|
|
Linear programming is log-space hard for P |
|
| Authors: | David Dobkin Richard J. Lipton Steven Reiss |
| Affiliation: | Department of Computer Science, Yale University, New Haven, CT 06520, U.S.A. |
| Abstract: | |
| Keywords: | Computational complexity NP-completeness linear programming |
| 本文献已被 ScienceDirect 等数据库收录！ | |