The Complexity of Testing Monomials in Multivariate Polynomials

DOI10.1007/978-3-642-22616-8_1zbMath1342.68158arXiv1007.2673OpenAlexW1766812168MaRDI QIDQ5199135

Zhixiang Chen, Bin Fu

Publication date: 12 August 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

complexitymultivariate polynomialsalgebramonomial testingmultilinear monomials

Mathematics Subject Classification ID

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

Related Items (5)

On testing monomials in multivariate polynomials ⋮ Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks ⋮ Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials ⋮ Monomials in arithmetic circuits: complete problems in the counting hierarchy ⋮ TOWARD RANDOMIZED TESTING OF q-MONOMIALS IN MULTIVARIATE POLYNOMIALS

This page was built for publication: The Complexity of Testing Monomials in Multivariate Polynomials