Schemes for deterministic polynomial factoring

@inproceedings{Ivanyos2009SchemesFD,
  title={Schemes for deterministic polynomial factoring},
  author={G. Ivanyos and M. Karpinski and N. Saxena},
  booktitle={ISSAC '09},
  year={2009}
}
  • G. Ivanyos, M. Karpinski, N. Saxena
  • Published in ISSAC '09 2009
  • Mathematics, Computer Science
  • In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations of permutation groups. We design a new generalization of the known conditional deterministic subexponential time polynomial factoring algorithm to get an underlying m-scheme. We then demonstrate how progress in understanding m-schemes relate to improvements in the deterministic complexity of factoring polynomials… CONTINUE READING
    16 Citations

    Topics from this paper.

    Deterministic Polynomial Factoring and Association Schemes
    • 12
    • PDF
    Deterministic polynomial factoring over finite fields: A uniform approach via P-schemes
    • Z. Guo
    • Mathematics, Computer Science
    • J. Symb. Comput.
    • 2020
    • 1
    • PDF
    Irreducibility and Deterministic r-th Root Finding over Finite Fields
    Deterministic polynomial factoring under the assumption of the Extended Riemann Hypothesis (ERH)
    • Aurko Roy
    • Computer Science, Mathematics
    • ArXiv
    • 2014
    Irreducibility and r-th root finding over finite fields
    • 3
    • PDF
    Deterministic Polynomial Time Algorithms for Matrix Completion Problems
    • 20
    • PDF

    References

    SHOWING 1-10 OF 15 REFERENCES
    Subquadratic-time factoring of polynomials over finite fields
    • 81
    • Highly Influential
    • PDF
    Factoring polynomials over finite fields
    • L. Rónyai
    • Mathematics, Computer Science
    • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
    • 1987
    • 102
    • Highly Influential
    • PDF
    Factoring polynomials over large finite fields*
    • 193
    • Highly Influential
    • PDF
    Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis
    • 22
    • Highly Influential
    Computing Frobenius maps and factoring polynomials
    • 180
    • Highly Influential
    • PDF
    Factorization of polynominals over finite fields in subexponential time under GRH
    • 24
    • Highly Influential
    Galois groups and factoring polynomials over finite fields
    • L. Rónyai
    • Mathematics, Computer Science
    • 30th Annual Symposium on Foundations of Computer Science
    • 1989
    • 19
    • Highly Influential
    • PDF
    On taking roots in finite fields
    • 138
    • Highly Influential
    Generalized Riemann Hypothesis and Factoring Polynomials over Finite Fields
    • M. Huang
    • Mathematics, Computer Science
    • J. Algorithms
    • 1991
    • 27
    • Highly Influential
    Factoring polynomials modulo special primes
    • 30
    • Highly Influential