On the complexity of approximate computation of real numbers by schemes and formulae in different rational bases

DOI10.1515/DMA.1992.2.3.259zbMath0787.68039OpenAlexW2075160947MaRDI QIDQ4284976

Sergey B. Gashkov

Publication date: 19 April 1994

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1992.2.3.259

zbMATH Keywords

Shannon functioncomplexity of approximate computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: On the complexity of approximate computation of real numbers by schemes and formulae in different rational bases