184,725 research outputs found
Monomial Testing and Applications
In this paper, we devise two algorithms for the problem of testing
-monomials of degree in any multivariate polynomial represented by a
circuit, regardless of the primality of . One is an time
randomized algorithm. The other is an time deterministic
algorithm for the same -monomial testing problem but requiring the
polynomials to be represented by tree-like circuits. Several applications of
-monomial testing are also given, including a deterministic
upper bound for the -set -packing problem.Comment: 17 pages, 4 figures, submitted FAW-AAIM 2013. arXiv admin note:
substantial text overlap with arXiv:1302.5898; and text overlap with
arXiv:1007.2675, arXiv:1007.2678, arXiv:1007.2673 by other author
- …