14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012, Proceedings
Series: Lecture Notes in Computer Science, Vol. 7442
Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (Eds.)
2012, XIV, 363 p. 42 illus.
Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
(net)
price for USA
ISBN 978-3-642-32973-9
digitally watermarked, no DRM
Included Format: PDF
download immediately after purchase
Softcover (also known as softback) version.
You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.
Standard shipping is free of charge for individual customers.
(net)
price for USA
ISBN 978-3-642-32972-2
free shipping for individuals worldwide
usually dispatched within 3 to 5 business days
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.
Content Level » Research
Keywords » complexity - holonomic functions - long integers - parallel algorithms - polynomial factorization
Related subjects » Hardware - Image Processing - Theoretical Computer Science
Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.