Fields of algebraic numbers computable in polynomial time. II

DOI10.1007/S10469-022-09661-3MaRDI QIDQ2145863zbMATH OpenOpenAlexFDO

Authors P. E. Alaev, Victor Selivanov

Publication date 15 June 2022

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

Full work available at URL https://doi.org/10.1007/s10469-022-09661-3

zbMATH Keywords

equivalence of polynomial-time computable structuresfield of algebraic numberspolynomial-time computable structures

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Group theory and generalizations (20-XX)

Recommendations

• Fields of algebraic numbers computable in polynomial time. I
• Polynomial computability of fields of algebraic numbers
• Polynomial-time presentations of algebraic number fields
• Polynomial time algorithms for sentences over number fields
• Computational complexity in algebraic systems

Cites work

• scientific article; zbMATH DE number 3868613 (Why is no real title available?)
• scientific article; zbMATH DE number 1302879 (Why is no real title available?)
• scientific article; zbMATH DE number 1390542 (Why is no real title available?)
• CONSTRUCTIVE ALGEBRAS I
• Equivalence Relations, Invariants, and Normal Forms
• Existence and uniqueness of structures computable in polynomial time
• Fields of algebraic numbers computable in polynomial time. I
• Polynomial-time presentations of algebraic number fields
• Polynomially computable structures with finitely many generators
• Structures computable in polynomial time. I
• Structures computable in polynomial time. II
• The shrinking property for NP and coNP
• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets

Cited in

(14)

• Inversion operations in algebraic structures
• On the main scientific achievements of Victor Selivanov
• Quotient structures and groups computable in polynomial time
• Punctually presented structures I: Closure theorems
• Polynomial computability of fields of algebraic numbers
• On P Versus NP for Parameter-Free Programs Over Algebraic Structures
• Fields of algebraic numbers computable in polynomial time. I
• The complexity of computing all subfields of an algebraic number field
• P versus NP and computability theoretic constructions in complexity theory over algebraic structures
• Polynomial-time presentations of algebraic number fields
• scientific article; zbMATH DE number 1746037 (Why is no real title available?)
• The complexity of inversion in groups
• Effective lower bounds on the matrix rank and their applications
• Calculs sur les structures de langage dénombrable

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

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