Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
Complexity of deciding Tarski algebra
Journal of Symbolic Computation
A bibliography of quantifier elimination for real closed fields
Journal of Symbolic Computation
The complexity of deciding consistency of systems of polynomials in exponent inequalities
Journal of Symbolic Computation
Complexity estimates depending on condition and round-off error
Journal of the ACM (JACM)
New complexity bounds for cylindrical decompositions of sub-pfaffian sets
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Hi-index | 0.00 |