Pages that link to "Item:Q1165575"
From MaRDI portal
The following pages link to The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic (Q1165575):
Displayed 3 items.
- Polynomial division and its computational complexity (Q1094135) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670) (← links)
