Derandomization via symmetric polytopes: poly-time factorization of certain sparse polynomials

DOI10.1145/3719022MaRDI QIDQ6949656zbMATH OpenFDO

Authors Pranav Bisht, Nitin Saxena

Publication date 1 August 2025

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

zbMATH Keywords

convex polytopesderandomizationsymmetric polynomialssparse polynomialsmultivariate polynomial factorizationfactor-sparsity

Mathematics Subject Classification ID

Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30) Computational aspects related to convexity (52B55) Polynomials in general fields (irreducibility, etc.) (12E05) Computational methods for problems pertaining to field theory (12-08)

This page was built for publication: Derandomization via symmetric polytopes: poly-time factorization of certain sparse polynomials

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