Nearly sharp complexity bounds for multiprocessor algebraic computations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1256781 (Why is no real title available?)
- scientific article; zbMATH DE number 1306858 (Why is no real title available?)
- scientific article; zbMATH DE number 3999284 (Why is no real title available?)
- Complexity of deciding Tarski algebra
- Decision tree complexity and Betti numbers
- Lower bounds for algebraic decision trees
- Lower bounds for arithmetic networks
- Lower bounds for arithmetic networks. II: Sum of Betti numbers
- Lower bounds for parallel linear programming and other problems
- On the Betti Numbers of Real Varieties
- On the Polyhedral Decision Problem
- On the Power of Real Turing Machines over Binary Inputs
- Point location in arrangements of hyperplanes
- Simulating probabilistic by deterministic algebraic computation trees
This page was built for publication: Nearly sharp complexity bounds for multiprocessor algebraic computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361876)
