Approximating linear programming is log-space complete for P

This publication has 5 references indexed in Scilit:

• The parallel complexity of the subgraph connectivity problem
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• A taxonomy of problems with fast parallel algorithms
  Information and Control, 1985
• The complexity of linear programming
  Theoretical Computer Science, 1980
• Linear programming is log-space hard for P
  Information Processing Letters, 1979
• The circuit value problem is log space complete for P
  ACM SIGACT News, 1975