<--- Back to Details
First PageDocument Content
Polynomials / Algebra / Finite fields / Computer algebra / Linear differential equation / Recurrence relation / Envelope / Matrix / XTR / Matrix exponential / Polynomial greatest common divisor
Date: 2015-06-25 22:36:20
Polynomials
Algebra
Finite fields
Computer algebra
Linear differential equation
Recurrence relation
Envelope
Matrix
XTR
Matrix exponential
Polynomial greatest common divisor

A fast algorithm for computing the p-curvature Alin Bostan Xavier Caruso Éric Schost

Add to Reading List

Source URL: www.csd.uwo.ca

Download Document from Source Website

File Size: 450,08 KB

Share Document on Facebook

Similar Documents

Safety Envelope for Security∗ Ashish Tiwari Bruno Dutertre SRI International  Pat Lincoln

Safety Envelope for Security∗ Ashish Tiwari Bruno Dutertre SRI International Pat Lincoln

DocID: 1xVb5 - View Document

Franklin County Recorder  Updated Policies Effective June 1, 2017 When documents are presented without a self-addressed stamped return envelope, the Recorder’s Office will be charging a flat $1.00 return fee for dispos

Franklin County Recorder Updated Policies Effective June 1, 2017 When documents are presented without a self-addressed stamped return envelope, the Recorder’s Office will be charging a flat $1.00 return fee for dispos

DocID: 1xUSu - View Document

Status and Outlook for the European Exploration Envelope Programme Dr David Parker – Director of Human and Robotic Exploration SSB Space Science Week, 27 March 2018 ESA UNCLASSIFIED - For Official Use

Status and Outlook for the European Exploration Envelope Programme Dr David Parker – Director of Human and Robotic Exploration SSB Space Science Week, 27 March 2018 ESA UNCLASSIFIED - For Official Use

DocID: 1vq4o - View Document

Sharp Bounds on Davenport-Schinzel Sequences of Every Order SETH PETTIE, University of Michigan One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of n un

Sharp Bounds on Davenport-Schinzel Sequences of Every Order SETH PETTIE, University of Michigan One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of n un

DocID: 1vp2a - View Document

K Service Source  Envelope Feeder LaserWriter ProEnvelope Feeder LaserWriterPS Envelope Feeder

K Service Source Envelope Feeder LaserWriter ProEnvelope Feeder LaserWriterPS Envelope Feeder

DocID: 1vj6n - View Document