Nearly sharp complexity bounds for multiprocessor algebraic computations
type: Item
instance of: scholarly article
title: Nearly sharp complexity bounds for multiprocessor algebraic computations
zbMATH Open document ID: 0872.68053
published in: Journal of Complexity
publication date: 1997-10-13T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 1040686
zbMATH Keywords: multiprocessor algebraic computation
author: Dima Grigoriev
MaRDI profile type: Publication
OpenAlex ID: W1969540178
cites work: Q4079605
cites work: On the Power of Real Turing Machines over Binary Inputs
cites work: Q4725742
cites work: Complexity of deciding Tarski algebra
cites work: Q4252710
cites work: Q4228517
cites work: Point location in arrangements of hyperplanes
cites work: Simulating probabilistic by deterministic algebraic computation trees
cites work: On the Betti Numbers of Real Varieties
cites work: Lower bounds for arithmetic networks
cites work: Lower bounds for arithmetic networks. II: Sum of Betti numbers
cites work: Lower bounds for parallel linear programming and other problems
cites work: Lower bounds for algebraic decision trees
cites work: Decision tree complexity and Betti numbers
cites work: On the Polyhedral Decision Problem
DOI: 10.1006/JCOM.1997.0436
description: scientific article; zbMATH DE number 1040686