Pages that link to "Item:Q1190747"
From MaRDI portal
The following pages link to The complexity of deciding consistency of systems of polynomials in exponent inequalities (Q1190747):
Displaying 9 items.
- Finding irreducible components of some real transcendental varieties (Q1332661) (← links)
- Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
- Complexity of stratifications of semi-Pfaffian sets (Q1894719) (← links)
- Recent Advances in Real Geometric Reasoning (Q3452275) (← links)
- (Q3485804) (← links)
- Deciding consistency of systems of polynomials in exponent inequalities in subexponential time (Q3973352) (← links)
- Complexity of cylindrical decompositions of sub-Pfaffian (Q5951564) (← links)
- Zero counting for a class of univariate Pfaffian functions (Q5964515) (← links)
- Decision problem for a class of univariate Pfaffian functions (Q6122406) (← links)