Efficient computation with sparse and dense polynomials
DS Roche - 2011 - uwspace.uwaterloo.ca
Computations with polynomials are at the heart of any computer algebra system and also
have many applications in engineering, coding theory, and cryptography. Generally …
have many applications in engineering, coding theory, and cryptography. Generally …
Computing the Degree of Black-Box Polynomials, with Applications
ES Zeron, JA De Loera - Handbook of Visual, Experimental and …, 2024 - Springer
This note presents simple techniques to recover the total degree of a black-box polynomial
and the value of its leading coefficients, relying only on few evaluations of the polynomial or …
and the value of its leading coefficients, relying only on few evaluations of the polynomial or …
[PDF][PDF] This little polynomial should keep the computer so busy it doesn't even know we're here.
C Knight - cs.uwaterloo.ca
This thesis presents new algorithms for computations with polynomials. Such computations
form the basis of some of the most important problems in computational mathematics, from …
form the basis of some of the most important problems in computational mathematics, from …