@article{1fba3ce86b0d440880af8ea0edf58194,
title = "Linear programming is log-space hard for P",
keywords = "Computational complexity, NP-completeness, linear programming",
author = "David Dobkin and Lipton, {Richard J.} and Steven Reiss",
note = "Funding Information: * Portions of this research were funded by an NSF Graduate Fellowship, by the ONR under Grant N00014-75-C-0450 .znd Grant N000014-75-C-0752. ** Authors{\textquoteright} current addresses: D. Dobkin, Department of Computer Science, Ilniversity of Arizona, Tucson, AZ 85704; R. Liptor:, EECS Department, University of California, Berkeley, CA; S. Reiss, Engineering Depart-ment and Computer Sc;tince Program, Brown Universl{\textquoteright}ty, Providence, RI 029 12.",
year = "1979",
month = feb,
day = "15",
doi = "10.1016/0020-0190(79)90152-2",
language = "English (US)",
volume = "8",
pages = "96--97",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "2",
}