Decomposition of Additive Cellular Automata

First Page		Document Content
Date: 2012-09-20 14:36:39 Abstract algebra Minimal polynomial Irreducible polynomial Factorization of polynomials Finite field Frobenius normal form Factorization of polynomials over a finite field and irreducibility tests Algebra Mathematics Polynomials		Decomposition of Additive Cellular Automata Add to Reading List Source URL: www.complex-systems.com Download Document from Source Website File Size: 287,26 KB Share Document on Facebook

	Fast polynomial factorization, modular composition, and multipoint evaluation of multivariate polynomials in small characteristic Christopher Umans∗ Computer Science Department California Institute of Technology DocID: 1rDyf - View Document
	A Characterization of Semisimple Plane Polynomial Automorphisms. Jean-Philippe FURTER, Dpt. of Math., Univ. of La Rochelle, av. M. Crépeau, La Rochelle, FRANCE email: DocID: 1raZ0 - View Document
	New Algorithms for Learning in Presence of Errors∗ Sanjeev Arora Rong Ge DocID: 1r7T9 - View Document
	Primary decomposition of zero-dimensional ideals: Putting Monico’s algorithm into practice extended abstract † DocID: 1r2Hp - View Document
	doi:j.jnt DocID: 1qIei - View Document