Parallel complexity of algebraic operations

DOI10.1007/BF01255671zbMath0748.94017MaRDI QIDQ4005330

I. K. Rystsov

Publication date: 26 September 1992

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

complexitygroupssemigroupsalgebraic operationsArithmetic operationsparallel realization by Boolean circuits

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unbounded fan-in circuits and associative functions
• Simulation of Parallel Random Access Machines by Circuits
• Parity, circuits, and the polynomial-time hierarchy
• Constant Depth Reducibility
• Parallel Prefix Computation

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