Pages that link to "Item:Q4396457"
From MaRDI portal
The following pages link to Subquadratic-time factoring of polynomials over finite fields (Q4396457):
Displayed 21 items.
- Explicit computation of isomorphisms between finite fields (Q700165) (← links)
- Fast rectangular matrix multiplication and some applications (Q931517) (← links)
- Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain (Q1033892) (← links)
- Factoring polynomials over arbitrary finite fields (Q1575686) (← links)
- Algorithms for exponentiation in finite fields (Q1581128) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields (Q2457415) (← links)
- A note on Gröbner bases and Berlekamp's algorithm (Q2474859) (← links)
- Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules. (Q2577534) (← links)
- Deterministic distinct-degree factorization of polynomials over finite fields (Q2643572) (← links)
- Hensel lifting and bivariate polynomial factorisation over finite fields (Q3147180) (← links)
- Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
- On design of circuits of logarithmic depth for inversion in finite fields (Q3184560) (← links)
- The black-box Niederreiter algorithm and its implementation over the binary field (Q4417166) (← links)
- Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
- Modular equations for hyperelliptic curves (Q4821057) (← links)
- On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other (Q5439060) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- On the deterministic complexity of factoring polynomials (Q5928878) (← links)
- Factoring polynomials over local fields. (Q5950986) (← links)