Daniel Lazard A Note on Upper Bounds for Ideal-Theoretic Problems. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1992, v:13, n:3, pp:231-234 [Journal]

James Renegar On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals. [Citation Graph (5, 0)][DBLP] J. Symb. Comput., 1992, v:13, n:3, pp:255-300 [Journal]

James Renegar On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part II: The General Decision Problem. Preliminaries for Quantifier Elimination. [Citation Graph (3, 0)][DBLP] J. Symb. Comput., 1992, v:13, n:3, pp:301-328 [Journal]

James Renegar On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination. [Citation Graph (3, 0)][DBLP] J. Symb. Comput., 1992, v:13, n:3, pp:329-352 [Journal]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP