Fast approximations of certain number-theoretic constants

Type: Article

Publication Date: 2015-05-01

Citations: 0

DOI: https://doi.org/10.1134/s1064562415030072

Locations

  • Doklady Mathematics - View

Similar Works

Action Title Year Authors
+ Number-theoretical algorithms 1996 Richard E. Crandall
+ The complexity of number-theoretic constants 1997 Eric Bach
+ Asymptotics of certain number-theoretic sums 2008 Н. Н. Осипов
+ The Approximation of Logarithmic Numbers 1957 H. T. Davis
+ Number Theoretic Algorithms 2021 Sachi Nandan Mohanty
Pabitra Kumar Tripathy
Suneeta Satpathy
+ Numerical Algorithms for Number Theory 2021 Karim Belabas
Henri Cohen
+ PDF Chat Large values of certain number-theoretic error terms 1990 Aleksandar Ivić
+ PDF Chat 3. Number theoretic algorithms 2016 Volker Diekert
Manfred Kufleitner
Gerhard Rosenberger
Ulrich Hertrampf
+ Formulas for some diophantine approximation constants 1972 Thomas W. Cusick
+ Pade-approximations in number theory 1981 F. Reukers
+ Eficient algorithms in number theory 1986 H. W. Lenstra
+ 6. Some Number Theoretic Algorithms 2015
+ Characterization of best approximations by sums of exponentials 1973 David W. Kammler
+ Limit Theorems and Best Constants in Approximation Theory 2000 Michael I. Ganzburg
+ Approximation for constant e and its applications 2008 Xiaojing Yang
Yong-In Kim
Kueiming Lo
+ A lower bound in asymptotic diophantine approximations 1968 William W. Adams
+ Some Exact Number Theory Computations via Probability Mechanisms 1995 Richard Blecksmith
Purushottam W. Laud
+ Asymptotic Algorithms 2016 T. C. Hu
Andrew B. Kahng
+ PDF Chat Approximation in (Poly-) Logarithmic Space 2021 Arindam Biswas
Venkatesh Raman
Saket Saurabh
+ PDF Chat Effcient approximation by “low-complexity” exponential algorithms 2008 Nicolas Bourgeois
Bruno Escoffier
Vangélis Th. Paschos

Works That Cite This (0)

Action Title Year Authors