Pages that link to "Item:Q1670714"
From MaRDI portal
The following pages link to Polynomial-time presentations of algebraic number fields (Q1670714):
Displaying 13 items.
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Primitive recursive ordered fields and some applications (Q831997) (← links)
- Finite field towers: Iterated presentation and complexity of arithmetic. (Q1609402) (← links)
- Polynomial computability of fields of algebraic numbers (Q1994088) (← links)
- Primitive recursive fields and categoricity (Q2011324) (← links)
- Fields of algebraic numbers computable in polynomial time. II (Q2145863) (← links)
- (Q4531985) (← links)
- Definable Subsets of Polynomial-Time Algebraic Structures (Q5042236) (← links)
- A structure of punctual dimension two (Q5111521) (← links)
- (Q5155667) (← links)
- A polynomial time algorithm for computing the HNF of a module over the integers of a number field (Q5244519) (← links)
- Primitive recursive ordered fields and some applications (Q5880940) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)