On the generation of multivariate polynomials which are hard to factor

DOI10.1145/167088.167291MaRDI QIDQ5248551zbMATH OpenOpenAlexFDO

Authors Adi Shamir

Publication date 7 May 2015

Published in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/167088.167291

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cited in

(3)

• Efficiently factoring polynomials modulo \(p^4\)
• Counting basic-irreducible factors \(\operatorname{mod} p^k\) in deterministic poly-time and \(p\)-adic applications
• Solutions of a Polynomial Equation Modulo a Prime Power

This page was built for publication: On the generation of multivariate polynomials which are hard to factor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248551)