Lower bounds for parallel linear programming and other problems
From MaRDI portal
Publication:2817655
DOI10.1145/195058.195413zbMath1345.68163OpenAlexW2018319397MaRDI QIDQ2817655
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195413
Programming involving graphs or networks (90C35) Linear programming (90C05) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items