Pages that link to "Item:Q784464"
From MaRDI portal
The following pages link to Fields of algebraic numbers computable in polynomial time. I (Q784464):
Displaying 20 items.
- Complexity of computation on real algebraic numbers (Q757065) (← links)
- Computing partial information out of intractable: powers of algebraic numbers as an example (Q1048926) (← links)
- Polynomial time algorithms for sentences over number fields (Q1187032) (← links)
- Computing in the field of complex algebraic numbers (Q1382036) (← 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)
- Heuristic algorithms for recognition of some cubic hypersurfaces (Q2027846) (← links)
- Finitely generated structures computable in polynomial time (Q2088618) (← links)
- Quotient structures and groups computable in polynomial time (Q2097210) (← links)
- Searching for applicable versions of computable structures (Q2117745) (← links)
- Fields of algebraic numbers computable in polynomial time. II (Q2145863) (← links)
- Polynomially computable structures with finitely many generators (Q2213937) (← links)
- Computably categorical fields via Fermat's last theorem (Q2851189) (← links)
- (Q4531985) (← links)
- Primitive recursive ordered fields and some applications (Q5880940) (← links)
- Generalization of the subset sum problem and cubic forms (Q6039136) (← links)
- A criterion for P-computability of structures (Q6072994) (← links)
- The complexity of inversion in groups (Q6199353) (← links)
- Effective lower bounds on the matrix rank and their applications (Q6535147) (← links)
