Suchergebnisse - "Algorithms in Number Theory"

Persistence of Perfect Numbers

Autoren: Emmerson, Parker orcid:0009-0007-1288-

Schlagwörter: Mathematical Discovery, Cryptography, Numerical Computation, Combinatorial Number Theory, Mathematical Research, Discrete Mathematics, Mathematical Algorithms, Numerical Methods, Polynomial Interpolation, Computational Number Theory, Asymptotic Analysis, Mathematical Functions, Analytic Number Theory, Integer Sequences, Computational Complexity, Mathematical Theorems, Theoretical Computer Science, Algorithms in Number Theory, Computer Algebra Systems, Rational Numbers, Polynomial Roots, Mathematical Conjecture, Polynomial Degree, Sequence Analysis, Theoretical Mathematics, Mathematics of Computation, Python Programming, Mathematical Modeling, Algorithm Efficiency, Heuristics

Relation: https://zenodo.org/communities/liberatedmathematics/; https://zenodo.org/records/14004795; oai:zenodo.org:14004795; https://doi.org/10.5281/zenodo.14004795

Verfügbarkeit: https://doi.org/10.5281/zenodo.14004795
https://zenodo.org/records/14004795

Complexity questions in number theory

Autoren: M. A. Frumkin

Quelle: Journal of Soviet Mathematics. 29:1502-1517

Schlagwörter: computational complexity, Continued fractions and generalizations, Analysis of algorithms and problem complexity, Research exposition (monographs, survey articles) pertaining to number theory, open problems, bibliography, diophantine approximations, 0102 computer and information sciences, quadratic diophantine equations, 01 natural sciences, computational number theory, Diophantine inequalities, continued fraction algorithm, linear diophantine equations, diophantine inequalities, 0101 mathematics, Radix representation, digital problems, algorithms in number theory, Quadratic and bilinear Diophantine equations

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3781247
https://link.springer.com/article/10.1007%2FBF02104748
https://link.springer.com/content/pdf/10.1007/BF02104748.pdf