MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000–000 SXXBETTER POLYNOMIALS FOR GNFS SHI BAI, CYRIL BOUVIER, ALEXANDER KRUPPA, AND PAUL ZIMMERMANN

Source URL: cosweb1.fau.edu

• Algebra
• Mathematics
• Polynomials
• Computer algebra
• Polynomial
• General number field sieve
• Resultant
• Irreducible polynomial
• Factorization
• Polynomial greatest common divisor
• Degree of a polynomial

An Introduction to the Dynamics of Real and Complex Quadratic Polynomials. May 30, 2011 Abstract

Source URL: www.homepages.ucl.ac.uk

• Mathematical analysis
• Fractals
• Complex dynamics
• Mathematics
• Dynamical systems
• Metaphysics
• Systems theory
• Periodic point
• Julia set
• Orbit
• Complex quadratic polynomial
• Periodic points of complex quadratic mappings

On Computing the Resultant of Generic Bivariate Polynomials Gilles Villard Univ Lyon, CNRS, ENS de Lyon, Inria, Université Claude Bernard Lyon 1, LIP UMR 5668, FLyon, France ABSTRACT An algorithm is presented for

Source URL: perso.ens-lyon.fr

LibPoly: A Library for Reasoning about Polynomials∗ Dejan Jovanovi´c and Bruno Dutertre SRI International Abstract LibPoly is a C library for computing with polynomials. It provides data structures to represent multiv

Source URL: smt-workshop.cs.uiowa.edu

• Algebra
• Mathematics
• Polynomials
• Abstract algebra
• Polynomial
• Irreducible polynomial
• Factorization of polynomials
• Resultant
• Algebraic geometry
• Factorization
• Polynomial greatest common divisor
• Permutation polynomial

Polynomials and the Fast Fourier Transform (FFT)

Source URL: web.cecs.pdx.edu

• Mathematics
• Mathematical analysis
• Algebra
• Fourier analysis
• Polynomials
• Unitary operators
• Multiplication
• Discrete Fourier transform
• Numerical analysis
• Polynomial
• Fourier transform
• Root of unity

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

Source URL: www.lix.polytechnique.fr

• Mathematics
• Multiplication
• Polynomials
• Algebra
• Multiplication algorithm
• Computer algebra
• ToomCook multiplication
• Karatsuba algorithm
• Degree of a polynomial
• Finite field
• Remainder
• Computational complexity of mathematical operations

Wiener Indices and Polynomials of Five Graph Operators Weigen Yan∗ School of Sciences, Jimei University Xiamen, China, and Academia Sinica Taipei, Taiwan

Source URL: precision.moscito.org

• Graph theory
• Mathematics
• Graph operations
• Graph coloring
• Line graph
• Graph
• End
• Ear decomposition
• Edge contraction
• Shortest Path Faster Algorithm

MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000–000 SXXROOT OPTIMIZATION OF POLYNOMIALS IN THE NUMBER FIELD SIEVE

Source URL: cosweb1.fau.edu

• Mathematics
• Algebra
• Abstract algebra
• Polynomials
• Integer factorization algorithms
• Commutative algebra
• Modular arithmetic
• General number field sieve
• Quadratic sieve
• Irreducible polynomial
• Polynomial
• Factorization

Matrix Representations for Positive Noncommutative Polynomials J.William Helton ∗

Source URL: math.ucsd.edu