Algebra for symbolic computation
This book deals with several topics in algebra useful for computer science applications and the symbolic treatment of algebraic problems, pointing out and discussing their algorithmic nature. The topics covered range from classical results such as the Euclidean algorithm, the Chinese remainder theor...
Sparad:
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Livre numérique |
| Språk: | Anglais |
| Publicerad: |
Milano :
Springer Milan
[20..].
Cham : Springer Nature |
| Upplaga: | 1st ed. 2012. |
| Serie: | La Matematica per il 3+2
|
| Ämnen: | |
| Länkar: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmärkning: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algebra for symbolic computation, Antonio Machì, Milan, Springer, 2012, 1 vol. (VIII-174 p.), Unitext, 978-88-470-2396-3 • Algebra for Symbolic Computation, Texte imprimé, 9788847023987 • Algebra for symbolic computation, Antonio Machì, Milan, Springer, 2012, 1 vol. (VIII-174 p.), Unitext, 978-88-470-2396-3 • Algebra for Symbolic Computation, Texte imprimé, 9788847023987 • Algebra for symbolic computation, Antonio Machì, Milan, Springer, 2012, 1 vol. (VIII-174 p.), Unitext, 978-88-470-2396-3 |
Innehållsförteckning:
- The Euclidean algorithm, the Chinese remainder theorem and interpolation p-adic series expansion The resultant Factorisation of polynomials The discrete Fourier transform.
- The Euclidean algorithm, the Chinese remainder theorem and interpolation
- p-adic series expansion
- The resultant
- Factorisation of polynomials
- The discrete Fourier transform