2008/11/28 by Joachim von zur Gathen, Gathen, Joachim von zur · 1 citation
Computer Science · Mathematics · #Data Management and Algorithms #Advanced Combinatorial Mathematics #Advanced Database Systems and Queries
paper · pdf · doi:10.48550/arxiv.0811.4726
A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number over a finite field. The relative error in our approximations is exponentially decaying in the input size.