scientific article; zbMATH DE number 3375582
From MaRDI portal
Publication:5646971
Cited in
(13)- Computationally efficient algorithms for a one-time pad scheme
- On the resolution of Thue inequalities
- An analogue of continued fractions in number theory for Nevanlinna theory
- Some uses of microcomputers in number theory research
- Universal generalization of the continued fraction algorithm
- In the search of convergents to \(\root{3}\of{2}\)
- Algebraic computations with continued fractions
- Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers
- The error term in Nevanlinna theory. II
- New generalization of continued fraction. I
- Transcendental numbers and diophantine approximations
- The Gonchar-Chudnovskies conjecture and a functional analogue of the Thue-Siegel-Roth theorem
- Rational approximations to \(\root 3\of 2\) and other algebraic numbers revisited
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5646971)