The following pages link to (Q5341755):
Displayed 17 items.
- Limited width parallel prefix circuits (Q547485) (← links)
- An improved parallel algorithm for integer GCD (Q582082) (← links)
- Monotone circuits for monotone weighted threshold functions (Q1044746) (← links)
- Communication-efficient parallel algorithms for distributed random-access machines (Q1104096) (← links)
- Efficient parallel circuits and algorithms for division (Q1114393) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- Characteristic measures of switching functions (Q1243267) (← links)
- Monte Carlo circuits for the abelian permutation group intersection problem (Q1820579) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Complexity of approximation problems (Q1962273) (← links)
- Probabilistic parallel prefix computation (Q2367585) (← links)
- The delay of circuits whose inputs have specified arrival times (Q2370422) (← links)
- Parallel complexity of algebraic operations (Q4005330) (← links)
- ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450) (← links)
- Verifiable Stream Computation and Arthur--Merlin Communication (Q5232326) (← links)
- Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees (Q5958114) (← links)