Pages that link to "Item:Q3495657"
From MaRDI portal
The following pages link to Optimal Size Integer Division Circuits (Q3495657):
Displayed 6 items.
- Complexity of computation in finite fields (Q378003) (← links)
- A parametric error analysis of Goldschmidt's division algorithm (Q1765225) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Oblivious sampling with applications to two-party \(k\)-means clustering (Q2188971) (← links)
- On the complexity of Fibonacci coding (Q2278702) (← links)