Fields of algebraic numbers computable in polynomial time. I

DOI10.1007/S10469-020-09565-0zbMATH Open1484.03058OpenAlexW3009523158WikidataQ114691257 ScholiaQ114691257MaRDI QIDQ784464FDOQ784464

Authors: P. E. Alaev, Victor Selivanov 

Publication date: 3 August 2020

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-020-09565-0

Recommendations

• Polynomial computability of fields of algebraic numbers
• Polynomial-time presentations of algebraic number fields
• Fields of algebraic numbers computable in polynomial time. II
• Computing in the field of complex algebraic numbers
• Algorithms in Algebraic Number Theory

zbMATH Keywords

field of complex algebraic numbersordered field of real algebraic numberspolynomially computable presentation

Mathematics Subject Classification ID

Algebraic numbers; rings of algebraic integers (11R04) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Number-theoretic algorithms; complexity (11Y16) Model theory (number-theoretic aspects) (11U09)

Cites Work

• Title not available (Why is that?)
• Factoring polynomials with rational coefficients
• Polynomial algorithms in computer algebra
• 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?)
• The Calculation of Multivariate Polynomial Resultants
• Title not available (Why is that?)
• Computable Algebra, General Theory and Theory of Computable Fields
• Existence and uniqueness of structures computable in polynomial time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theorie Der Numerierungen III
• Structures computable in polynomial time. I
• On the degree of extensions generated by finitely many algebraic numbers

Cited In (25)

• Polynomially computable structures with finitely many generators
• Primitive recursive ordered fields and some applications
• Polynomial computability of fields of algebraic numbers
• Fields of algebraic numbers computable in polynomial time. II
• Polynomials with Rational Coefficients Which are Hard to Compute
• Polynomial-time presentations of algebraic number fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Heuristic algorithms for recognition of some cubic hypersurfaces
• Computation of algebraic numbers and arithmetic operations over them with linear memory
• The complexity of computing all subfields of an algebraic number field
• A criterion for P-computability of structures
• Affine transformations of algebraic numbers
• The complexity of inversion in groups
• Computational complexity of computing polynomials over the fields of real and complex numbers
• Computing partial information out of intractable: powers of algebraic numbers as an example
• Computably categorical fields via Fermat's last theorem
• Effective lower bounds on the matrix rank and their applications
• Computing bits of algebraic numbers
• Finitely generated structures computable in polynomial time
• Title not available (Why is that?)
• Generalization of the subset sum problem and cubic forms
• Quotient structures and groups computable in polynomial time
• Searching for applicable versions of computable structures
• Title not available (Why is that?)

This page was built for publication: Fields of algebraic numbers computable in polynomial time. I

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