The complexity of basic complex operations
From MaRDI portal
Publication:1148674
DOI10.1007/BF02237978zbMath0452.68053OpenAlexW2137837155MaRDI QIDQ1148674
Publication date: 1981
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02237978
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some elementary proofs of lower bounds in complexity theory
- On multiplication of 2 \(\times\) 2 matrices
- A bound on the multiplicative efficiency of iteration
- On the Parallel Evaluation of Certain Arithmetic Expressions
- Algebras Having Linear Multiplicative Complexities
- On the number of multiplications necessary to compute certain functions
This page was built for publication: The complexity of basic complex operations