Optimization and NP_R-completeness of certain fewnomials

DOI10.1145/1577190.1577212zbMath1356.65038arXiv0904.4060OpenAlexW2025911494WikidataQ130994384 ScholiaQ130994384MaRDI QIDQ2959026

J. Maurice Rojas, David C. Thompson, Philippe Pébay

Publication date: 3 February 2017

Published in: Proceedings of the 2009 conference on Symbolic numeric computation (Search for Journal in Brave)

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

zbMATH Keywords

condition numberexponential sumcircuitpolynomial timeBSS model

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Signomial and polynomial optimization via relative entropy and partial dualization ⋮ Newton polytopes and relative entropy optimization

This page was built for publication: Optimization and NP_R-completeness of certain fewnomials