CMU-CS-97-136Computer Science Department School of Computer Science, Carnegie Mellon University
CMU-CS-97-136
Adam R. Klivans May 1997
Submitted in partial fulfillment of the requirements for the degree of
CMU-CS-97-136.ps
Keywords: Computational algebra, circuit complexity theory, factoring
polynomials
n is a composite number. We give
algorithms to compute such factorizations along with the algebraic
classifications.38 pages
| |

Return to:
SCS Technical Report Collection This page maintained by reports@cs.cmu.edu |