Summary: Almost Tight Recursion Tree Bounds for the
Descartes Method
Arno Eigenwillig
Max-Planck-Institut f¨ur
Informatik
Saarbr¨ucken, Germany
arno@mpi-inf.mpg.de
Vikram Sharma
Dept. of Computer Science,
NYU
New York, USA
sharma@cs.nyu.edu
Chee K. Yap

Dept. of Computer Science,
NYU
New York, USA
yap@cs.nyu.edu
ABSTRACT
We give a unified ("basis free") framework for the Descartes

Source: Akritas, Alkiviadis G. - Department of Computer and Communication Engineering, University of Thessaly

Collections: Computer Technologies and Information Sciences