scientific article; zbMATH DE number 515222

zbMATH Open0791.68079MaRDI QIDQ4282847

Could not fetch data.

Publication date: 14 March 1994

Title of this publication is not available (Why is that?)

zbMATH Keywords

computational complexityevaluationparallel algorithmcommunication complexityalgebraic expressions

Mathematics Subject Classification ID

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

Related Items (6)

Parallel evaluation of arithmetic circuits ⋮ Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits ⋮ Parallelism and algorithms for algebraic manipulation: current work ⋮ The actual complexity of parallel evaluation of low degree polynomials ⋮ Expressibility and Parallel Complexity ⋮ Title not available (Why is that?)

Recommendations

• The actual complexity of parallel evaluation of low degree polynomials 👍 👎
• A complexity theory of efficient parallel algorithms 👍 👎
• Parallel algorithms for some algebraic operations on polynomial equations 👍 👎
• Parallel evaluation of arithmetic circuits 👍 👎
• Parallel Algorithms for Algebraic Problems 👍 👎
• Parallelism and algorithms for algebraic manipulation: current work 👍 👎
• Parallel complexity of algebraic operations 👍 👎
• Expressibility and Parallel Complexity 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)