Polynomial-Time Presentations of Algebraic Number Fields-Reference-Cited by-同舟云学术

Polynomial-Time Presentations of Algebraic Number Fields

Published:2018 Issue: Volume: Page:20-29
ISSN:0302-9743
Container-title:Sailing Routes in the World of Computation
language:
Short-container-title:

Author:

Alaev Pavel,Selivanov Victor

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-94418-0_2

Reference24 articles.

1. Ershov, Y.L., Goncharov, S.S.: Constructive Models. Plenum, New York (1999)

2. Stoltenberg-Hansen, V., Tucker, J.V.: Effective algebras. In: Handbook of Logic in Computer Science: Semantic Modelling, vol. IV, pp. 357–526. Oxford University Press, Oxford (1995)

3. Rabin, M.O.: Computable algebra, general theory and theory of computable fields. Trans. Am. Math. Soc. 95, 341–360 (1960)

4. Ershov, Y.L.: Theorie der Nummerierungen III. Ziets. Math. Logik Grundl. Math. 23, 289–371 (1977)

5. Nerode, A., Remmel, J.B.: Complexity theoretic algebra I, vector spaces over finite fields. In: Proceedings of Structure in Complexity, 2nd Annual Conference, pp. 218–239. Computer Sci. Press, New York (1987)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Primitive recursive ordered fields and some applications;Computability;2023-01-19

2. Fields of Algebraic Numbers Computable in Polynomial Time. II;Algebra and Logic;2022-01

3. Primitive Recursive Ordered Fields and Some Applications;Computer Algebra in Scientific Computing;2021

4. A structure of punctual dimension two;Proceedings of the American Mathematical Society;2020-04-14

5. Definable Subsets of Polynomial-Time Algebraic Structures;Computer Science – Theory and Applications;2020