On the Space Complexity of Linear Programming with Preprocessing.
Yael Tauman KalaiRan RazOded RegevPublished in: ITCS (2016)
Keyphrases
- space complexity
- linear programming
- preprocessing
- linear program
- post processing
- worst case
- np hard
- feature extraction
- integer programming
- space requirements
- objective function
- primal dual
- network flow
- arc consistency
- preprocessing step
- optimal solution
- nonlinear programming
- dynamic programming
- preprocessing phase
- preprocessing steps
- column generation
- database
- quadratic programming
- constraint propagation
- feasible solution
- preprocessing stage
- linear arithmetic constraints
- feature selection