On the combinatorial and algebraic complexity of quantifier elimination

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Saugata Basu New York Univ., New York, NY
Richard Pollack New York Univ., New York, NY
Marie-Françoise Roy Univ. de Rennes, Rennes, France
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 43 Issue 6, Nov. 1996
Pages 1002-1045
ACM New York, NY, USA
table of contents doi>10.1145/235809.235813
On the combinatorial and algebraic complexity of quantifier elimination Published by ACM 1996 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 29
· Downloads (cumulative): 716
· Citation Count: 70


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder