On the generation of multivariate polynomials which are hard to factor

DOI10.1145/167088.167291zbMath1310.68262OpenAlexW2082920569MaRDI QIDQ5248551

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

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

Related Items (2)

Efficiently factoring polynomials modulo \(p^4\) ⋮ Unnamed Item

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