Fields of Algebraic Numbers Computable in Polynomial Time. I

dc.contributor.author	Alaev P.E.
dc.contributor.author	Selivanov V.L.
dc.date.accessioned	2021-02-24T20:31:30Z
dc.date.available	2021-02-24T20:31:30Z
dc.date.issued	2020
dc.identifier.issn	0002-5232
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/160698
dc.description.abstract	© 2020, Springer Science+Business Media, LLC, part of Springer Nature. It is proved that the field of complex algebraic numbers has an isomorphic presentation computable in polynomial time. A similar fact is proved for the ordered field of real algebraic numbers. The constructed polynomially computable presentations are based on a natural presentation of algebraic numbers by rational polynomials. Also new algorithms for computing values of polynomials on algebraic numbers and for solving equations in one variable with algebraic coefficients are presented.
dc.relation.ispartofseries	Algebra and Logic
dc.subject	field of complex algebraic numbers
dc.subject	ordered field of real algebraic numbers
dc.subject	polynomially computable presentation
dc.title	Fields of Algebraic Numbers Computable in Polynomial Time. I
dc.type	Article
dc.relation.ispartofseries-issue	6
dc.relation.ispartofseries-volume	58
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	447
dc.source.id	SCOPUS00025232-2020-58-6-SID85081549779

Files in this item

Size: 118.3Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.