Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity

DOI10.1090/trans2/155/01zbMath0784.68037OpenAlexW4205748146MaRDI QIDQ4005386

Alexander I. Barvinok, Anatoly M. Vershik

Publication date: 26 September 1992

Published in: American Mathematical Society Translations: Series 2 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/trans2/155/01

zbMATH Keywords

polynomial-time algorithmsemialgebraic setmembership problem\(P=NP\) problemequinomial families

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semialgebraic sets and related spaces (14P10)

Related Items

Mathematical problems for the next century