The Parallel Complexity of Exponentiating Polynomials over Finite Fields - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Faith E. Fich, Martin Tompa. The Parallel Complexity of Exponentiating Polynomials over Finite Fields. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, 6-8 May 1985, Providence, Rhode Island, USA. pages 38-47, ACM, 1985.

This author has not been identified. Look up 'Faith E. Fich' in GoogleThis author has not been identified. Look up 'Martin Tompa' in Google

runs on WebDSL