Spedizione gratuita con Packeta per un prezzo superiore a 79.99 €
BRT 7.99 Punto BRT 7.99 DHL 7.99 HR Parcel 7.49 GLS 3.99

? points 172 b
72.67
Magazzino esterno in piccole quantità Inviamo tra 13-16 giorni

30 giorni per il reso


Potrebbe interessarti anche


I MIGLIORI
Structures J. E. Gordon / In brossura
common.buy 19.58
I MIGLIORI
Make Your Own Neural Network Tariq Rashid / In brossura
common.buy 57.47
Mobile Suit Gundam: The Origin 6 Yasuhiko Yoshikazu / Rigido
common.buy 29.32
Slim Aarons: Women Slim Aarons / Rigido
common.buy 84.02
Y'All Jay B. Sauceda / Rigido
common.buy 21.61
QlikView for Finance B. Diane Blackwood / In brossura
common.buy 48.37
Computer Communications and Networks John R. Freer / In brossura
common.buy 72.67
Effective Management in Practice Robin Wensley / In brossura
common.buy 45.16
Little Book of Ireland Ciara Boylan / Rigido
common.buy 30.71
Amazon Town Charles Wagley / In brossura
common.buy 87.12
Economic Justice and Liberty Huei Chun Su / Rigido
common.buy 248.01

This book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2012, held in Maribor, Slovenia, in September 2012. The 28 full papers presented were carefully reviewed and selected for inclusion in this book. §One of the main themes of the CASC workshop series, namely polynomial algebra, is represented by contributions devoted to new algorithms for computing comprehensive Gröbner and involutive systems,§parallelization of the Gröbner bases computation, the study of quasi-stable polynomial ideals, new algorithms to compute the Jacobson form of a matrix of Ore polynomials, a recursive Leverrier algorithm for inversion of dense matrices whose entries are monic polynomials, root isolation of zero-dimensional triangular polynomial systems, optimal computation of the third power of a long integer, investigation of the complexity of solving systems with few independent monomials, the study of ill-conditioned polynomial systems, a method for polynomial root-finding via eigen-solving and randomization, an algorithm for fast dense polynomial multiplication with Java using the new opaque typed method, and sparse polynomial powering using heaps.

Regala questo libro oggi stesso
È facile
1 Aggiungi il libro al carrello e scegli la consegna come regalo 2 Ti invieremo subito il buono 3 Il libro arriverà all'indirizzo del destinatario

Accesso

Accedi al tuo account. Non hai ancora un account Libristo? Crealo ora!

 
obbligatorio
obbligatorio

Non hai un account? Ottieni i vantaggi di un account Libristo!

Con un account Libristo, avrai tutto sotto controllo.

Crea un account Libristo