Pages that link to "Item:Q1994088"
From MaRDI portal
The following pages link to Polynomial computability of fields of algebraic numbers (Q1994088):
Displaying 14 items.
- Isomorphisms of algebraic number fields (Q713173) (← links)
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Computing in the field of complex algebraic numbers (Q1382036) (← links)
- Polynomial-time presentations of algebraic number fields (Q1670714) (← links)
- On constructive number fields and computability of solutions of PDEs (Q1707150) (← links)
- The complexity of computing all subfields of an algebraic number field (Q1733310) (← links)
- Fields of algebraic numbers computable in polynomial time. II (Q2145863) (← links)
- Non-computable impressions of computable external rays of quadratic polynomials (Q2339170) (← links)
- Computably categorical fields via Fermat's last theorem (Q2851189) (← links)
- (Q3704922) (← links)
- (Q4531985) (← links)
- Definable Subsets of Polynomial-Time Algebraic Structures (Q5042236) (← links)
- Computable embeddability for algebraic structures (Q5876742) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)