Polynomial-time presentations of algebraic number fields

DOI10.1007/978-3-319-94418-0_2OpenAlexW2810664674MaRDI QIDQ1670714

P. E. Alaev, Victor L. Selivanov

Publication date: 6 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94418-0_2

zbMATH Keywords

complexity boundalgebraic numberordered fieldpolynomial-time presentable structure

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Model theory (number-theoretic aspects) (11U09) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (8)

Definable Subsets of Polynomial-Time Algebraic Structures ⋮ Primitive recursive ordered fields and some applications ⋮ Fields of algebraic numbers computable in polynomial time. II ⋮ On the main scientific achievements of Victor Selivanov ⋮ A structure of punctual dimension two ⋮ Primitive recursive ordered fields and some applications ⋮ Primitive recursive fields and categoricity ⋮ Unnamed Item

This page was built for publication: Polynomial-time presentations of algebraic number fields