Fields of algebraic numbers computable in polynomial time. II

This paper is a continuation of [Algebra i Logika, 58, No. 6, 673—705 (2019)], where we constructed polynomial-time presentations for the field of complex algebraic numbers and for the ordered field of real algebraic numbers. Here we discuss other known natural presentations of such structures. It is shown that all these presentations are equivalent to each other and prove a theorem which explains why this is so.
While analyzing the presentations mentioned, we introduce the notion of a quotient structure. It is shown that the question whether a polynomial-time computable quotient structure is equivalent to an ordinary one is almost equivalent to the ${\rm P = NP}$ problem. Conditions are found under which the answer is positive.