Publication:1059094

DOI10.1007/BF02104748zbMATH Open0566.10001OpenAlexW2021335023MaRDI QIDQ1059094FDOQ1059094

M. A. Frumkin

Publication date: 1985

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02104748

zbMATH Keywords

computational complexitybibliographyopen problemscomputational number theorycontinued fraction algorithmdiophantine inequalitiesquadratic diophantine equationslinear diophantine equationsalgorithms in number theorydiophantine approximations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Radix representation; digital problems (11A63) Continued fractions and generalizations (11J70) Quadratic and bilinear Diophantine equations (11D09) Diophantine inequalities (11D75) Research exposition (monographs, survey articles) pertaining to number theory (11-02)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Riemann's hypothesis and tests for primality
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• An Introduction to the Geometry of Numbers
• The Jacobi-Perron algorithm its theory and application
• On the Computational Complexity of Determining the Solvability or Unsolvability of the Equation X 2 - DY 2 = -1
• Euclid's Algorithm for Large Numbers
• Algorithm and bound for the greatest common divisor of n integers
• The least quadratic non residue
• Fast computation of continued fraction expansions.
• Minkowski Reduction of Integral Matrices
• Every Prime Has a Succinct Certificate
• The metrical theory of Jacobi-Perron algorithm
• A New Version of the Euclidean Algorith
• Using the Blankinship algorithm to find the general solution of a linear diophantine equation
• A generalization of the algorithm for continued fractions related to the algorithm of Viggo Brunn
• Number of natural solutions of a system of linear Diophantine equations
• Fundamental units of cubic fields of positive discriminant
• Machine-independent description of certain machine complexity classes
• Approximation properties of Jacobi's algorithm
• Explicit representations of Dirichlet approximations
• On best two-dimensional Dirichlet-approximations and their algorithmic calculation
• A two-dimensional continued fraction algorithm for best approximations with an application in cubic number fields.
• An Effective Number Geometric Method of Computing the Fundamental Units of an Algebraic Number Field
• Calculating the General Solution of a Linear Diophantine Equation

Cited In (5)

• On random nonsingular Hermite normal form
• The complexity of divisibility
• Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
• Title not available (Why is that?)
• Topics in real and complex number complexity theory

This page was built for publication: Complexity questions in number theory

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