scientific article; zbMATH DE number 515222

MaRDI QIDQ4282847zbMATH OpenFDO

Authors Robert Manger

Publication date 14 March 1994

zbMATH Keywords

algebraic expressionscommunication complexitycomputational complexityevaluationparallel algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Distributed algorithms (68W15)

Recommendations

• Parallel complexity of algebraic operations
• scientific article; zbMATH DE number 4047092
• The actual complexity of parallel evaluation of low degree polynomials
• scientific article; zbMATH DE number 4172382
• Parallelism and algorithms for algebraic manipulation: current work
• Parallel Algorithms for Algebraic Problems
• Parallel algorithms for some algebraic operations on polynomial equations
• Parallel evaluation of arithmetic circuits
• Expressibility and Parallel Complexity
• A complexity theory of efficient parallel algorithms

Cited in

(17)

• A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
• Parallel restructuring and evaluation of expressions
• Nearly sharp complexity bounds for multiprocessor algebraic computations
• Parallel evaluation of arithmetic circuits
• Using fewer processors to reduce time complexities of semigroup computations
• Efficient parallel solutions of linear algebraic circuits
• Evaluation of linear, quadratic and cubic expressions on a binary tree
• scientific article; zbMATH DE number 4172382 (Why is no real title available?)
• scientific article; zbMATH DE number 3848613 (Why is no real title available?)
• scientific article; zbMATH DE number 4026815 (Why is no real title available?)
• scientific article; zbMATH DE number 4047092 (Why is no real title available?)
• Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
• Parallelism and algorithms for algebraic manipulation: current work
• A Direct Approach to the Parallel Evaluation of Rational Expressions with a Small Number of Processors
• Expressibility and Parallel Complexity
• Evaluating uniform expressions within two steps of minimum parallel time
• The actual complexity of parallel evaluation of low degree polynomials

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4282847)