The following pages link to (Q4234088):
Displaying 12 items.
- A subquadratic algorithm for minimum palindromic factorization (Q405573) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- Subexponential-time computation of isolated primary components of a polynomial ideal (Q2027324) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362) (← links)
- Polynomial Time Attack on Wild McEliece Over Quadratic Extensions (Q2979114) (← links)
- Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation (Q3519554) (← links)
- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering (Q3644213) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- Practical polynomial factoring in polynomial time (Q5254167) (← links)
- On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic (Q5382575) (← links)
- Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)
