Fields of algebraic numbers computable in polynomial time. I
type: Item
instance of: scholarly article
title: Fields of algebraic numbers computable in polynomial time. I
zbMATH Open document ID: 1484.03058
author: P. E. Alaev
author: Victor Selivanov
published in: Algebra and Logic
publication date: 2020-08-03T00:00:00Z
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 11R04
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11U09
zbMATH DE Number: 7226853
zbMATH Keywords: field of complex algebraic numbers
zbMATH Keywords: ordered field of real algebraic numbers
zbMATH Keywords: polynomially computable presentation
Wikidata QID: Q114691257
MaRDI profile type: Publication
full work available at URL: s10469-020-09565-0
OpenAlex ID: W3009523158
cites work: Q4249365
cites work: Q3697106
cites work: Factoring polynomials with rational coefficients
cites work: Computable Algebra, General Theory and Theory of Computable Fields
cites work: Theorie Der Numerierungen III
cites work: Q4935938
cites work: The Calculation of Multivariate Polynomial Resultants
cites work: Polynomial algorithms in computer algebra
cites work: Q3139838
cites work: Q4953977
cites work: Q4079605
cites work: Existence and uniqueness of structures computable in polynomial time
cites work: Structures computable in polynomial time. I
cites work: Q4091421
cites work: Q3992490
cites work: Q4221106
cites work: On the degree of extensions generated by finitely many algebraic numbers
DOI: 10.1007/S10469-020-09565-0
description: scientific article; zbMATH DE number 7226853