Smoothness Testing of Polynomials over Finite Fields Jean-Franc ¸ ois Biasse and Michael J. Jacobson Jr. Department of Computer Science, University of Calgary 2500 University Drive NW

First Page		Document Content
Date: 2016-05-19 17:03:48 Mathematics Multiplication Polynomials Algebra Multiplication algorithm Computer algebra ToomCook multiplication Karatsuba algorithm Degree of a polynomial Finite field Remainder Computational complexity of mathematical operations		Smoothness Testing of Polynomials over Finite Fields Jean-Franc ¸ ois Biasse and Michael J. Jacobson Jr. Department of Computer Science, University of Calgary 2500 University Drive NW Add to Reading List Source URL: www.lix.polytechnique.fr Download Document from Source Website File Size: 331,66 KB Share Document on Facebook

	Around cubic hypersurfaces Olivier Debarre June 23, 2015 Abstract A cubic hypersurface X is defined by one polynomial equation of degree 3 in n variables with coefficients in a field K, such as DocID: 1xTdZ - View Document
	INTERSECTIONS OF POLYNOMIAL ORBITS, AND A DYNAMICAL MORDELL-LANG CONJECTURE DRAGOS GHIOCA, THOMAS J. TUCKER, AND MICHAEL E. ZIEVE Abstract. We prove that if nonlinear complex polynomials of the same degree have orbits wi DocID: 1tdLY - View Document
	Facts about two-dimensional polynomialsGiven: f (x, y) = f00 + f10x + f01y + f11xy + ... + fttxty t ∈ F[x, y] Fact 1: fy0 (x) := f (x, y0) is a one-dimensional polynomial of degree t. Proof: f (x, y0) = (f00 + DocID: 1rNBK - 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
	EQUATIONS FOR CHOW VARIETIES, THEIR SECANT VARIETIES AND OTHER VARIETIES ARISING IN COMPLEXITY THEORY A Dissertation by YONGHUI GUAN DocID: 1qIdU - View Document