Parallel complexity of algebraic operations

DOI10.1007/BF01255671MaRDI QIDQ4005330zbMATH OpenFDO

Authors I. K. Rystsov

Publication date 26 September 1992

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01255671

zbMATH Keywords

algebraic operationsArithmetic operationscomplexitygroupsparallel realization by Boolean circuitssemigroups

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites work

• Constant Depth Reducibility
• scientific article; zbMATH DE number 3841223 (Why is no real title available?)
• scientific article; zbMATH DE number 3801775 (Why is no real title available?)
• scientific article; zbMATH DE number 3214539 (Why is no real title available?)
• Parallel Prefix Computation
• Parity, circuits, and the polynomial-time hierarchy
• Simulation of Parallel Random Access Machines by Circuits
• Unbounded fan-in circuits and associative functions

Cited in

(6)

• Parallelizable algebras
• Parallelism and algorithms for algebraic manipulation: current work
• scientific article; zbMATH DE number 515222 (Why is no real title available?)
• Parallel Processing and Applied Mathematics
• The actual complexity of parallel evaluation of low degree polynomials
• Parallel algorithms for some algebraic operations on polynomial equations

This page was built for publication: Parallel complexity of algebraic operations

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