Faster polynomial multiplication over finite fields David Harvey University of New South Wales 8th December AustMS NZMS 2014, University of Melbourne - Arithmetic circuit complexity - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-12-30 21:41:38 Multiplication Multiplication algorithm Finite field Polynomial Arithmetic circuit complexity Λ-ring Mathematics Algebra Abstract algebra		Faster polynomial multiplication over finite fields David Harvey University of New South Wales 8th December AustMS/NZMS 2014, University of Melbourne Add to Reading List Source URL: web.maths.unsw.edu.au Download Document from Source Website File Size: 139,05 KB Share Document on Facebook

	573 Documenta Math. On the Structure of Selmer Groups of Λ-Adic Deformations over p-Adic Lie Extensions DocID: 1qSFM - View Document
	Canad. J. Math. Vol), 2007 pp. 332–342 Endomorphism Rings of Finite Global Dimension Graham J. Leuschke Abstract. For a commutative local ring R, consider (noncommutative) R-algebras Λ of the form Λ = DocID: 1kSyE - View Document
	Cluster Separability In Relativistic Quantum Mechanics W. N. Polyzou∗ - The University of Iowa B. D. Keister - NSF Phys. Rev. C86 ∗ Research supported by the in part by DocID: 1fvDe - View Document
	Performance evaluation of demodulation with diversity — A combinatorial approach III: Threshold analysis S. Bliudze∗ D. Krob∗ DocID: 18LmT - View Document
	Faster polynomial multiplication over finite fields David Harvey University of New South Wales 8th December AustMS/NZMS 2014, University of Melbourne DocID: 17Oh8 - View Document