We study factoring algorithms for general sparse polynomials and sparse polynomials of bounded individual degree and prove the following results.
1. We give a deterministic polynomial-time algorithm which takes as input an $n$-variate $s$-sparse polynomial $f$ of bounded individual degree $d$ and outputs a list of circuits which contains ... more >>>