The following pages link to (Q5302071):
Displayed 6 items.
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
- Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
- Taking roots over high extensions of finite fields (Q2862538) (← links)