Sparse complex polynomials and polynomial reducibility
- 30 April 1977
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 14 (2) , 210-221
- https://doi.org/10.1016/s0022-0000(77)80013-5
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971