TOWARD RANDOMIZED TESTING OF q-MONOMIALS IN MULTIVARIATE POLYNOMIALS

DOI10.1142/S1793830914500165zbMath1372.68291arXiv1302.5898MaRDI QIDQ2875680

Shenshi Chen, Quanhai Yang, Yaqing Chen

Publication date: 11 August 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.5898

zbMATH Keywords

complexitymonomialsmultivariate polynomialsrandomized algorithmsalgebramonomial testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Cites Work

• Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials
• Narrow sieves for parameterized paths and packings
• Faster Algebraic Algorithms for Path and Packing Problems
• Learning DNF in time
• The Complexity of Testing Monomials in Multivariate Polynomials
• Algorithms for Testing Monomials in Multivariate Polynomials