Fields of algebraic numbers computable in polynomial time. II

DOI10.1007/s10469-022-09661-3OpenAlexW4229061960MaRDI QIDQ2145863

P. E. Alaev, Victor L. 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)

Related Items (5)

On the main scientific achievements of Victor Selivanov ⋮ Inversion operations in algebraic structures ⋮ Punctually presented structures I: Closure theorems ⋮ The complexity of inversion in groups ⋮ Quotient structures and groups computable in polynomial time

Cites Work

• Existence and uniqueness of structures computable in polynomial time
• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
• The shrinking property for NP and coNP
• Fields of algebraic numbers computable in polynomial time. I
• Structures computable in polynomial time. II
• Polynomial-time presentations of algebraic number fields
• Polynomially computable structures with finitely many generators
• Structures computable in polynomial time. I
• Equivalence Relations, Invariants, and Normal Forms
• CONSTRUCTIVE ALGEBRAS I
• Unnamed Item
• Unnamed Item
• Unnamed Item

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