Deterministic polynomial factoring and association schemes

DOI10.1112/S1461157013000296zbMath1320.11116arXiv1205.5653OpenAlexW2143160814MaRDI QIDQ5170254

Nitin Saxena, Gábor Ivanyos, Manuel Arora, Marek Karpinski

Publication date: 23 July 2014

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.5653

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Association schemes, strongly regular graphs (05E30) Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06)

Related Items (4)

Deterministic root finding over finite fields using Graeffe transforms ⋮ Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Unnamed Item ⋮ A Generalised Successive Resultants Algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• The Riemann hypothesis. A resource for the afficionado and virtuoso alike
• Factoring polynomials modulo special primes
• Permutation group approach to association schemes
• Factoring polynomials and primitive elements for special primes
• Relation algebras and \(t\)-vertex condition graphs
• Cyclotomic schemes over finite rings
• Association schemes, superschemes, and relations invariant under permutation groups
• Computing Frobenius maps and factoring polynomials
• The distribution of integers with a divisor in a given interval
• Über Primzahlen in arithmetischen Folgen
• Algebraic structure of association schemes of prime order
• Elementare Betrachtungen zur Primzahltheorie
• The least quadratic non residue
• Trading GRH for algebra: Algorithms for factoring polynomials and related structures
• Fast Polynomial Factorization and Modular Composition
• On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs
• Generalized riemann hypothesis and factoring polynomials over finite fields
• Factoring polynomials over finite fields
• Probabilistic Algorithms in Finite Fields
• Galois Groups and Factoring Polynomials over Finite Fields
• Subquadratic-time factoring of polynomials over finite fields
• Explicit bounds for primes in residue classes
• Theory of Association Schemes
• Factoring polynomials over special finite fields
• On the deterministic complexity of factoring polynomials
• An inextensible association scheme associated with a 4-regular graph

This page was built for publication: Deterministic polynomial factoring and association schemes