Polynomial computability of fields of algebraic numbers
From MaRDI portal
Publication:1994088
DOI10.1134/S1064562418050137zbMath1453.03046OpenAlexW2891212621MaRDI QIDQ1994088
P. E. Alaev, Victor L. Selivanov
Publication date: 1 November 2018
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562418050137
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (3)
Definable Subsets of Polynomial-Time Algebraic Structures ⋮ On the main scientific achievements of Victor Selivanov ⋮ Computable embeddability for algebraic structures
Cites Work
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- Factoring polynomials with rational coefficients
- Polynomial-time versus recursive models
- Structures computable in polynomial time. I
- Theorie Der Numerierungen III
- Computable Algebra, General Theory and Theory of Computable Fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Polynomial computability of fields of algebraic numbers