Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents


Institute:
Collection:
Print in Citation style Print version     Display:
Sort by:
 Basket 
Almost Tight Recursion Tree Bounds for the Descartes Method
Editors: Dumas, Jean-Guillaume
Authors: Eigenwillig, Arno; Sharma, Vikram; Yap, Chee K.
Place of Publication: New York, USA
Publisher: ACM
Date of Publication (YYYY-MM-DD): 2006
Title of Proceedings: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Start Page: 71
End Page: 78
Document Type: Conference-Paper
ID: 314542.0
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.