[IEEE Comput. Soc. Press 35th Annual Symposium on...

  • Main
  • [IEEE Comput. Soc. Press 35th Annual...

[IEEE Comput. Soc. Press 35th Annual Symposium on Foundations of Computer Science - Santa Fe, NM, USA (20-22 Nov. 1994)] Proceedings 35th Annual Symposium on Foundations of Computer Science - On the combinatorial and algebraic complexity of quantifier elimination

Basu, S., Pollack, R., Roy, M.-F.
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Year:
1994
Language:
english
DOI:
10.1109/SFCS.1994.365728
File:
PDF, 839 KB
english, 1994
Conversion to is in progress
Conversion to is failed