Cites work
Cited in
(29)- Depth-first search is inherently sequential
- An introduction to parallelism in combinatorial optimization
- The parallel complexity of deadlock detection
- Parallel search algorithms in global optimization
- Parallel approximation algorithms for bin packing
- -productions in context-free grammars
- The maximum flow problem is log space complete for P
- An appraisal of computational complexity for operations researchers
- Expressing combinatorial optimization problems by linear programs
- A canonical form for generalized linear constraints
- Learning in parallel
- Algorithms and complexity analysis for some flow problems
- On renamable Horn and generalized Horn functions
- Gainfree Leontief substitution flow problems
- Polynomial size linear programs for problems in \textsc{P}
- Classifying the computational complexity of problems
- Two complexity results on c-optimality in experimental design
- The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
- THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†
- The complexity of linear programming
- The complexity of linear programming
- On the parallel approximability of a subclass of quadratic programming.
- On the complexity of scheduling unrelated parallel machines with limited preemptions
- Various approaches to multiobjective linear programming problems with interval costs and interval weights
- A generalization of von Neumann's reduction from the assignment problem to zero-sum games
- The 1982 ACM Turing Award lecture. An overview of computational complexity
- Is the space complexity of planted clique recovery the same as that of detection?
- Approximating linear programming is log-space complete for P
- Prediction-preserving reducibility
This page was built for publication: Linear programming is log-space hard for P
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255780)
