Eigenwillig, Arno Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Sharma, Vikram Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Eigenwillig, A., Sharma, V., & Yap, C. K. (2006). Almost Tight Recursion Tree Bounds for the Descartes Method. In ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation (pp. 71-78). New York, USA: ACM.