Pages that link to "Item:Q5906578"
From MaRDI portal
The following pages link to Fast construction of irreducible polynomials over finite fields (Q5906578):
Displaying 47 items.
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Genus 2 point counting over prime fields (Q412199) (← links)
- Fast arithmetics in Artin-Schreier towers over finite fields (Q420745) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Detecting lacunary perfect powers and computing their roots (Q650838) (← links)
- Explicit computation of isomorphisms between finite fields (Q700165) (← links)
- Modular composition via factorization (Q722764) (← links)
- Fast arithmetic in unramified \(p\)-adic fields (Q973961) (← links)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
- A parameterized view on matroid optimization problems (Q1035682) (← links)
- Concatenation of pseudorandom binary sequences (Q1046758) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- On some approximation problems concerning sparse polynomials over finite fields (Q1351508) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- On division polynomial PIT and supersingularity (Q1623917) (← links)
- An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank (Q1650656) (← links)
- Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\) (Q1679708) (← links)
- Primality testing with Gaussian periods (Q1737980) (← links)
- A faster pseudo-primality test (Q1758643) (← links)
- High-order lifting and integrality certification (Q1878491) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Computing Puiseux series: a fast divide and conquer algorithm (Q2077183) (← links)
- Sparse polynomial interpolation based on derivatives (Q2156377) (← links)
- Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic (Q2260788) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Factorization of a class of composed polynomials (Q2420476) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Faster sparse multivariate polynomial interpolation of straight-line programs (Q2635066) (← links)
- Certified dense linear system solving (Q2643521) (← links)
- Standard generators of finite fields and their cyclic subgroups (Q2687267) (← links)
- Taking roots over high extensions of finite fields (Q2862538) (← links)
- Inversion Modulo Zero-Dimensional Regular Chains (Q2915000) (← links)
- Calculating the set of orders of elements in the finite linear groups (Q3545834) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
- On the Complexity of the Montes Ideal Factorization Algorithm (Q4931648) (← links)
- Computing Modular Polynomials (Q5697474) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)
- Iterative constructions of irreducible polynomials from isogenies (Q6565497) (← links)
- Bivariate polynomial reduction and elimination ideal over finite fields (Q6615408) (← links)
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities (Q6631548) (← links)
- Sparse multiplication of multivariate linear differential operators (Q6666531) (← links)
