Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials
From MaRDI portal
Publication:1944393
DOI10.1007/s10878-012-9496-5zbMath1288.90072arXiv1007.2678MaRDI QIDQ1944393
Publication date: 25 March 2013
Published in: Journal of Combinatorial Optimization, Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.2678
multivariate polynomials; approximation algorithms; inapproximability; monomial testing; maximum multilinear monomials; monomial coefficient computing; monomial coefficients
90C27: Combinatorial optimization
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
68W20: Randomized algorithms