On the Space Complexity of Linear Programming with Preprocessing

ITCS, pp. 293-300, 2016.

Cited by: 10|Bibtex|Views48|Links
EI

Abstract:

It is well known that Linear Programming is P -complete, with a logspace reduction. In this work we ask whether Linear Programming remains P -complete, even if the polyhedron (i.e., the set of linear inequality constraints) is a fixed polyhedron, for each input size, and only the objective function is given as input. More formally, we...More

Code:

Data:

Your rating :
0

 

Tags
Comments