Exact parameterized multilinear monomial counting via k-layer subset convolution and k-disjoint sum

LNCS v. 6842 has title: Computing and combinatorics: proceedings of the 17th Annual International Conference, COCOON 2011We present new algorithms for exact multilinear k-monomial counting which is to compute the sum of coefficients of all degree-k multilinear monomials in a given polynomial P over a ring R described by an arithmetic circuit C. If the polynomial can be represented as a product of two polynomials with degree at most d< k, our algorithm can solve this problem in ...link_to_subscribed_fulltextThe 17th Annual International Computing and Combinatorics Conference (COCOON'11), Dallas, TX., 14-16 August 2011. In Lecture Notes in Computer Science, 2011, v. 6842, p. 74-8