Besplatna dostava Overseas kurirskom službom iznad 59.99 €
Overseas 4.99 Pošta 4.99 DPD 5.99 GLS 3.99 GLS paketomat 3.49 Box Now 4.49

Besplatna dostava putem Box Now paketomata i Overseas kurirske službe iznad 59,99 €!
? points 154 b
61.28
Vanjske zalihe u manjem broju Šaljemo za 13-16 dana

30 dana za povrat kupljenih proizvoda


Moglo bi vas zanimati i


TOP
Structures J. E. Gordon / Meki uvez
common.buy 16.19
TOP
Make Your Own Neural Network Tariq Rashid / Meki uvez
common.buy 48.19
Mobile Suit Gundam: The Origin 6 Yasuhiko Yoshikazu / Tvrdi uvez
common.buy 24.24
Slim Aarons: Women Slim Aarons / Tvrdi uvez
common.buy 74.06
Y'All Jay B. Sauceda / Tvrdi uvez
common.buy 19.01
QlikView for Finance B. Diane Blackwood / Meki uvez
common.buy 40.65
Computer Communications and Networks John R. Freer / Meki uvez
common.buy 61.28
Little Book of Ireland Ciara Boylan / Tvrdi uvez
common.buy 25.55
Effective Management in Practice Robin Wensley / Meki uvez
common.buy 39.74
Amazon Town Charles Wagley / Meki uvez
common.buy 73.76
Economic Justice and Liberty Huei Chun Su / Tvrdi uvez
common.buy 218.47

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.

Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimca

Prijava

Prijavite se na svoj račun. Još nemate Libristo račun? Otvorite ga odmah!

 
obvezno
obvezno

Nemate račun? Ostvarite pogodnosti uz Libristo račun!

Sve ćete imati pod kontrolom uz Libristo račun.

Otvoriti Libristo račun