Parallel evaluation of arithmetic circuits
From MaRDI portal
Publication:1365929
DOI10.1016/0304-3975(95)00252-9zbMath0878.68071MaRDI QIDQ1365929
Jean-Louis Roch, Nathalie Revol
Publication date: 10 September 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00252-9
68W35: Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- On uniform circuit complexity
- Towards a complexity theory of synchronous parallel computation
- Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
- Gaussian elimination is not optimal
- Boolean circuits versus arithmetic circuits
- A taxonomy of problems with fast parallel algorithms
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Greatest common divisors of polynomials given by straight-line programs
- Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
- A Regular Layout for Parallel Adders
- On Relating Time and Space to Size and Depth
- A simple parallel tree contraction algorithm
