Skip to main content
Conference Proceedings

How lower and upper complexity bounds meet in elimination theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 948 33-69
DOI: 10.1007/3-540-60114-7_4
40Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Pardo, L. M. (1995). How lower and upper complexity bounds meet in elimination theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 948, pp. 33–69). Springer Verlag. https://doi.org/10.1007/3-540-60114-7_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free