Taking Roots over High Extensions of Finite Fields ´ Eric Schost

First Page		Document Content
Date: 2011-11-11 00:09:18 Mathematics Algebra Abstract algebra Polynomials Computer algebra Finite fields Modular arithmetic Binary operations TonelliShanks algorithm Root of unity Time complexity Multiplication algorithm		Taking Roots over High Extensions of Finite Fields ´ Eric Schost Add to Reading List Source URL: www.csd.uwo.ca Download Document from Source Website File Size: 291,97 KB Share Document on Facebook

	14. Calculus and Linear Algebra Po-Shen Loh CMU Putnam Seminar, Fall DocID: 1rmie - View Document
	Taking Roots over High Extensions of Finite Fields ´ Eric Schost DocID: 1r551 - View Document
	Fast arithmetics in Artin-Schreier towers over finite fields ´ Schost2 L. De Feo1 and E. 2 1´ DocID: 1r1SC - View Document
	Interpolation of polynomials given by straight-line programs ´ Sanchit Garg a Eric Schost b a India DocID: 1qfxY - View Document
	On the existence of equiangular tight frames M´aty´as A. Sustik Dept. of Computer Sciences, The University of Texas, Austin, TX 78712 DocID: 1qeEM - View Document