Polynomials: an algorithmic approach. / Mignotte, Maurice

Public ISBD Titre : Polynomials: an algorithmic approach. Type de document : texte imprimé Auteurs : Mignotte, Maurice ; Stefanescu, Doru Editeur : Singapore : Springer Année de publication : 1999 Importance : xi - 306 p. ISBN/ISSN/EAN : 978-981-4021-51-7 Langues : Anglais Catégories : 11-XX Number theory:11-01 Instructional exposition (textbooks, tutorial papers, etc.) 11-XX Number theory:11CXX Polynomials and matrices:11C08 Polynomials 12-XX Field theory and polynomials:12-01 Instructional exposition (textbooks, tutorial papers, etc.) 12-XX Field theory and polynomials:12DXX Real and complex fields:12D05 Polynomials: factorization 12-XX Field theory and polynomials:12EXX General field theory:12E05 Polynomials (irreducibility, etc.) 12-XX Field theory and polynomials:12Y05 Computational aspects of field theory and polynomials 68-XX Computer science :68WXX Algorithms :68W30 Symbolic computation and algebraic computation Mots-clés : upper bounds  height  length  mahler measure  polynomial sizes  complex polynomials  irreducibility criteria  polynomial interpolation  bezoutian  elimination  algebraic complexity  algorithms  polynomials  lenstra-lenstra-lov? algorithm  norm  resultant Index. décimale : 12C Monographie Polynomials: an algorithmic approach. [texte imprimé] / Mignotte, Maurice ; Stefanescu, Doru . - Singapore : Springer, 1999 . - xi - 306 p. ISBN : 978-981-4021-51-7 Langues : Anglais Catégories : 11-XX Number theory:11-01 Instructional exposition (textbooks, tutorial papers, etc.) 11-XX Number theory:11CXX Polynomials and matrices:11C08 Polynomials 12-XX Field theory and polynomials:12-01 Instructional exposition (textbooks, tutorial papers, etc.) 12-XX Field theory and polynomials:12DXX Real and complex fields:12D05 Polynomials: factorization 12-XX Field theory and polynomials:12EXX General field theory:12E05 Polynomials (irreducibility, etc.) 12-XX Field theory and polynomials:12Y05 Computational aspects of field theory and polynomials 68-XX Computer science :68WXX Algorithms :68W30 Symbolic computation and algebraic computation Mots-clés : upper bounds  height  length  mahler measure  polynomial sizes  complex polynomials  irreducibility criteria  polynomial interpolation  bezoutian  elimination  algebraic complexity  algorithms  polynomials  lenstra-lenstra-lov? algorithm  norm  resultant Index. décimale : 12C Monographie

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
12267	12C45	imprimé / autre	CRDM	12/THEORIE DES CORPS ET POLYNOMES	Disponible

---

page 1/1