The following pages link to (Q4282847):
Displaying 13 items.
- The actual complexity of parallel evaluation of low degree polynomials (Q582800) (← links)
- A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation (Q1123611) (← links)
- Parallel restructuring and evaluation of expressions (Q1185242) (← links)
- Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876) (← links)
- Parallel evaluation of arithmetic circuits (Q1365929) (← links)
- Using fewer processors to reduce time complexities of semigroup computations (Q1823684) (← links)
- Efficient parallel solutions of linear algebraic circuits (Q1878708) (← links)
- Evaluation of linear, quadratic and cubic expressions on a binary tree (Q3033306) (← links)
- (Q3197319) (← links)
- (Q3768388) (← links)
- Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits (Q3796739) (← links)
- Parallelism and algorithms for algebraic manipulation: current work (Q3802602) (← links)
- Expressibility and Parallel Complexity (Q4207580) (← links)