Lower Bounds in a Parallel Model without Bit Operations
From MaRDI portal
Publication:4268719
DOI10.1137/S0097539794282930zbMath0940.68052MaRDI QIDQ4268719
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (11)
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts ⋮ On invariance of degree for certain computations ⋮ Shadows of Newton polytopes ⋮ Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs ⋮ Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs ⋮ Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. ⋮ On the Symmetries of and Equivalence Test for Design Polynomials. ⋮ Geometric complexity theory V: Efficient algorithms for Noether normalization ⋮ $$P\mathop{ =}\limits^{?}NP$$ ⋮ Hardness of approximation for knapsack problems ⋮ Unifying known lower bounds via geometric complexity theory
This page was built for publication: Lower Bounds in a Parallel Model without Bit Operations
