<--- Back to Details
First PageDocument Content
Polynomials / Computer algebra / Algebra / Symmetric functions / Symmetric polynomial / Finite field / Irreducible polynomial / Elementary symmetric polynomial / XTR / Resultant / Splitting circle method / Factorization of polynomials over finite fields
Date: 2005-07-11 17:31:38
Polynomials
Computer algebra
Algebra
Symmetric functions
Symmetric polynomial
Finite field
Irreducible polynomial
Elementary symmetric polynomial
XTR
Resultant
Splitting circle method
Factorization of polynomials over finite fields

Fast Computation of Special Resultants ´ Alin Bostan a Philippe Flajolet a Bruno Salvy a Eric Schost b a Algorithms

Add to Reading List

Source URL: www.csd.uwo.ca

Download Document from Source Website

File Size: 327,25 KB

Share Document on Facebook

Similar Documents

Computational Methods 14-04, 14Qxx [1] Fatima K. Abu Salem and Kamal Khuri-Makdisi, Fast Jacobian group operations for C3,4 curves over a large finite field, LMS J. Comput. Math), 307–328 (electronic). MR MR2

Computational Methods 14-04, 14Qxx [1] Fatima K. Abu Salem and Kamal Khuri-Makdisi, Fast Jacobian group operations for C3,4 curves over a large finite field, LMS J. Comput. Math), 307–328 (electronic). MR MR2

DocID: 1v3WQ - View Document

FINITE FIELDS KEITH CONRAD This handout discusses finite fields: how to construct them, properties of elements in a finite field, and relations between different finite fields. We write Z/(p) and Fp interchangeably for t

FINITE FIELDS KEITH CONRAD This handout discusses finite fields: how to construct them, properties of elements in a finite field, and relations between different finite fields. We write Z/(p) and Fp interchangeably for t

DocID: 1uTzP - View Document

MATH 205 (TOPICS IN ALGEBRAIC NUMBER THEORY) - SPRINGProfessor: Cristian D. Popescu Course Topic: Global Fields Course Description: The main goal of this course is to understand global fields (finite field extensi

MATH 205 (TOPICS IN ALGEBRAIC NUMBER THEORY) - SPRINGProfessor: Cristian D. Popescu Course Topic: Global Fields Course Description: The main goal of this course is to understand global fields (finite field extensi

DocID: 1uKaO - View Document

FINITE GROUP SCHEMES OVER BASES WITH LOW RAMIFICATION BRIAN CONRAD Abstract. Let A0 be a complete characteristic (0, p) discrete valuation ring with absolute ramification degree e and a perfect residue field. We are inte

FINITE GROUP SCHEMES OVER BASES WITH LOW RAMIFICATION BRIAN CONRAD Abstract. Let A0 be a complete characteristic (0, p) discrete valuation ring with absolute ramification degree e and a perfect residue field. We are inte

DocID: 1uGnL - View Document

Pseudorandom generators for low degree polynomials Andrej Bogdanov∗ March 3, 2005 Abstract We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite field

Pseudorandom generators for low degree polynomials Andrej Bogdanov∗ March 3, 2005 Abstract We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite field

DocID: 1uF0R - View Document