New Algorithms for Finding Irreducible Polynomials Over Finite Fields
From MaRDI portal
Publication:3497178
DOI10.2307/2008704zbMath0712.11077OpenAlexW4230683277MaRDI QIDQ3497178
Publication date: 1990
Full work available at URL: https://doi.org/10.2307/2008704
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items
Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\), Constructing irreducible polynomials over finite fields, On multi-partition communication complexity, Counting irreducible binomials over finite fields, On some approximation problems concerning sparse polynomials over finite fields, On finding primitive roots in finite fields, Constructing normal bases in finite fields, Polynomial Multiplication over Finite Fields in Time \( O(n \log n \), Some results on uniform arithmetic circuit complexity, Algorithms in Algebraic Number Theory, On the complexity exponent of polynomial system solving, Modular composition modulo triangular sets and applications, Hadamard tensors and lower bounds on multiparty communication complexity, Hardness results and spectral techniques for combinatorial problems on circulant graphs, Univariate polynomial factorization over finite fields, Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\), Deterministically generating Picard groups of hyperelliptic curves over finite fields, Standard generators of finite fields and their cyclic subgroups, Ideal uniform multipartite secret sharing schemes, Efficient Finite Fields in the Maxima Computer Algebra System, Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time, Cryptographic hash functions from sequences of lifted Paley graphs, Computing isomorphisms and embeddings of finite fields, Computational indistinguishability: A sample hierarchy, On the construction of a family of transversal subspaces over finite fields, Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields, Constructing nonresidues in finite fields and the extended Riemann hypothesis, A general construction for monoid-based knapsack protocols, Fast computation of special resultants, Computational problems in the theory of finite fields, Fast amortized multi-point evaluation, Factoring polynomials over special finite fields, Factoring polynomials over finite fields: A survey, Searching for Primitive Roots in Finite Fields, Explicit computation of isomorphisms between finite fields, Fast arithmetic in unramified \(p\)-adic fields, Representative families for matroid intersections, with applications to location, packing, and covering problems, The Chebotarev density theorem for function fields -- incomplete intervals, Fast multivariate multi-point evaluation revisited, A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus$ via the Coin Problem], Lower bounds for matrix factorization, The complexity of the matroid-greedoid partition problem, A correspondence of certain irreducible polynomials over finite fields, Lower bounds for matrix factorization, Explicit Near-Ramanujan Graphs of Every Degree, Finding irreducible and primitive polynomials, On Sets of Irreducible Polynomials Closed by Composition, Randomness in interactive proofs, PSPACE has constant-round quantum interactive proof systems
