ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
The complexity of quantifier elimination in the theory of an algebraically closed field
 
Purchase a copyPurchase a copy
Source
Pages: 152  
Year of Publication: 1989
Order Number:AAI9001370
Author
Douglas John Ierardi
Publisher
Cornell University  Ithaca, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 2
Additional Information:

cited by   collaborative colleagues  

Tools and Actions: Review this Doctoral Thesis  

CITED BY  2
Ágnes Szántó, Complexity of the Wu-Ritt decomposition, Proceedings of the second international symposium on Parallel symbolic computation, p.139-149, July 20-22, 1997, Maui, Hawaii, United States
Leonard M. Adleman , Ming-Deh Huang, Counting points on curves and Abelian varieties over finite fields, Journal of Symbolic Computation, v.32 n.3, p.171-189, 09/01/2001
Collaborative Colleagues:
Douglas John Ierardi: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player