Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3958731
- Parallel evaluation of arithmetic circuits
- scientific article; zbMATH DE number 4172382
- Efficient parallel solutions of linear algebraic circuits
- Fast Parallel Arithmetic via Modular Representation
- scientific article; zbMATH DE number 4213451
- scientific article; zbMATH DE number 3999284
- scientific article; zbMATH DE number 515222
- Fast parallel algorithms for binary multiplication and their implementation on systolic architectures
Cited in
(13)- Parallel construction of binary trees with near optimal weighted path length
- An optimal EREW PRAM algorithm for minimum spanning tree verification
- scientific article; zbMATH DE number 2114154 (Why is no real title available?)
- The complexity of computing maximal word functions
- Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
- How hard is computing the edit distance?
- Non-commutative arithmetic circuits: depth reduction and size lower bounds
- Size-depth trade-offs for monotone arithmetic circuits
- Boolean circuits versus arithmetic circuits
- How hard is to compute the edit distance
- scientific article; zbMATH DE number 4172382 (Why is no real title available?)
- The complexity of two problems on arithmetic circuits
- Parallel evaluation of arithmetic circuits
This page was built for publication: Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796739)
