Pages that link to "Item:Q2145863"
From MaRDI portal
The following pages link to Fields of algebraic numbers computable in polynomial time. II (Q2145863):
Displaying 13 items.
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Polynomial time algorithms for sentences over number fields (Q1187032) (← links)
- Polynomial-time presentations of algebraic number fields (Q1670714) (← links)
- The complexity of computing all subfields of an algebraic number field (Q1733310) (← links)
- Polynomial computability of fields of algebraic numbers (Q1994088) (← links)
- Quotient structures and groups computable in polynomial time (Q2097210) (← links)
- On P Versus NP for Parameter-Free Programs Over Algebraic Structures (Q2707072) (← links)
- (Q4531985) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)
- Inversion operations in algebraic structures (Q6146820) (← links)
- Punctually presented structures I: Closure theorems (Q6146821) (← links)
- The complexity of inversion in groups (Q6199353) (← links)
- Effective lower bounds on the matrix rank and their applications (Q6535147) (← links)