Polynomial-Time Presentations of Algebraic Number Fields Full article

Journal	Lecture Notes in Computer Science ISSN: 0302-9743 , E-ISSN: 1611-3349
Output data	Year: 2018, Volume: 10936, Pages: 20-29 Pages count : 10 DOI: 10.1007/978-3-319-94418-0_2
Tags	Algebraic number; Complexity bound; Ordered field; Polynomial; Polynomial-time presentable structure
Authors	Alaev Pavel 1,2 , Selivanov V. 3,4
Affiliations	1 S. L. Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russian Federation 2 Novosibirsk State University, Novosibirsk, Russian Federation 3 A. P. Ershov Institute of Informatics Systems SB RAS, Novosibirsk, Russian Federation 4 Kazan Federal University, Kazan, Russian Federation