The following pages link to (Q3947116):
Displaying 5 items.
- Definability and fast quantifier elimination in algebraically closed fields (Q798314) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- The computational complexity of a set of quadratic functions (Q1163861) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Fast norm computation in smooth-degree abelian number fields (Q6142769) (← links)
