Deciding Consistency of Systems of Polynomial in Exponent Inequalities in Subexponential Time
Nikolaj N. Vorobjov · Progress in mathematics · 1991
Let h ∈ Z [ X 1 ,… , X n ] be an arbitrary polynomial. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.