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

DOI10.1515/DMA.1992.2.3.259MaRDI QIDQ4284976zbMATH OpenOpenAlexFDO

Authors S. 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)

Cited in

(3)

• scientific article; zbMATH DE number 4133978 (Why is no real title available?)
• On the complexity of conversion between classic real number representations
• scientific article; zbMATH DE number 4046332 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284976)