New Algorithms for Finding Irreducible Polynomials Over Finite Fields
From MaRDI portal
(Redirected from Publication:3497178)
Recommendations
Cited in
(75)- Factoring polynomials over special finite fields
- Cryptographic hash functions from sequences of lifted Paley graphs
- scientific article; zbMATH DE number 177888 (Why is no real title available?)
- Randomness in interactive proofs
- Constructing normal bases in finite fields
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem
- Lower bounds for matrix factorization
- Constructing irreducible polynomials over finite fields
- Efficient representation of lattice path matroids
- Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
- Lower bounds for matrix factorization
- Computational indistinguishability: A sample hierarchy
- Explicit computation of isomorphisms between finite fields
- Standard generators of finite fields and their cyclic subgroups
- Modular composition modulo triangular sets and applications
- Fast, algebraic multivariate multipoint evaluation in small characteristic and applications
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- Counting irreducible binomials over finite fields
- Fast construction of irreducible polynomials over finite fields
- Irreducibility and deterministic \(r\)-th root finding over finite fields
- Optimal adjacency labels for subgraphs of Cartesian products
- Computing isomorphisms and embeddings of finite fields
- An algorithm for finding distinguished chains of polynomials
- New polynomial-time algorithms for Camion bases
- Enumerating hyperelliptic curves over finite fields in quasilinear time
- The complexity of the matroid-greedoid partition problem
- Computational problems in the theory of finite fields
- On the construction of a family of transversal subspaces over finite fields
- On the complexity exponent of polynomial system solving
- scientific article; zbMATH DE number 3997938 (Why is no real title available?)
- Representative families for matroid intersections, with applications to location, packing, and covering problems
- The Chebotarev density theorem for function fields -- incomplete intervals
- PSPACE has constant-round quantum interactive proof systems
- On exponential-time hypotheses, derandomization, and circuit lower bounds
- Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
- Plane curve germs and contact factorization
- Univariate polynomial factorization over finite fields
- Some results on uniform arithmetic circuit complexity
- Finding irreducible and primitive polynomials
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- Factoring polynomials over finite fields: A survey
- Constructing nonresidues in finite fields and the extended Riemann hypothesis
- scientific article; zbMATH DE number 1418483 (Why is no real title available?)
- Ideal uniform multipartite secret sharing schemes
- Deterministically generating Picard groups of hyperelliptic curves over finite fields
- Polynomial multiplication over finite fields in time O(n n)
- Fast arithmetic in unramified \(p\)-adic fields
- Computational experiences on the distances of polynomials to irreducible polynomials
- On sets of irreducible polynomials closed by composition
- On finding primitive roots in finite fields
- A general construction for monoid-based knapsack protocols
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
- scientific article; zbMATH DE number 6868511 (Why is no real title available?)
- A correspondence of certain irreducible polynomials over finite fields
- The computational advantage of MIP* vanishes in the presence of noise
- The computational advantage of MIP* vanishes in the presence of noise
- New algorithms for generating Conway polynomials over finite fields
- Fast amortized multi-point evaluation
- scientific article; zbMATH DE number 5733040 (Why is no real title available?)
- Multiplication in finite fields with Chudnovsky-type algorithms over the projective line
- Fast multivariate multi-point evaluation revisited
- Algorithms in Algebraic Number Theory
- On the construction of certain odd degree irreducible polynomials over finite fields
- Optimal explicit small-depth formulas for the coin problem
- Hadamard tensors and lower bounds on multiparty communication complexity
- Efficient Finite Fields in the Maxima Computer Algebra System
- Searching for Primitive Roots in Finite Fields
- Fast computation of special resultants
- On multi-partition communication complexity
- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time
- On some approximation problems concerning sparse polynomials over finite fields
- Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)
- Explicit Near-Ramanujan Graphs of Every Degree
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
This page was built for publication: New Algorithms for Finding Irreducible Polynomials Over Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3497178)
