Overview
- State-of-the-art research
- Includes contributions from a set of experts in various coefficient domains and in applications of manipulation of polynomials
- Provides interesting perspective on the rich and active area of research in theory and algorithms for polynomials over various coefficient domains
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8942)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (12 chapters)
-
Front Matter
-
Back Matter
Keywords
About this book
Algebra and number theory have always been counted among the most beautiful mathematical areas with deep proofs and elegant results. However, for a long time they were not considered that important in view of the lack of real-life applications. This has dramatically changed: nowadays we find applications of algebra and number theory frequently in our daily life.
This book focuses on the theory and algorithms for polynomials over various coefficient domains such as a finite field or ring. The operations on polynomials in the focus are factorization, composition and decomposition, basis computation for modules, etc. Algorithms for such operations on polynomials have always been a central interest in computer algebra, as it combines formal (the variables) and algebraic or numeric (the coefficients) aspects.
The papers presented were selected from the Workshop on Computer Algebra and Polynomials, which was held in Linz at the Johann Radon Institute for Computational and Applied Mathematics (RICAM) during November 25-29, 2013, at the occasion of the Special Semester on Applications of Algebra and Number Theory.
Editors and Affiliations
Bibliographic Information
Book Title: Computer Algebra and Polynomials
Book Subtitle: Applications of Algebra and Number Theory
Editors: Jaime Gutierrez, Josef Schicho, Martin Weimann
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-15081-9
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2015
Softcover ISBN: 978-3-319-15080-2Published: 02 February 2015
eBook ISBN: 978-3-319-15081-9Published: 20 January 2015
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: IX, 213
Number of Illustrations: 29 b/w illustrations
Topics: Symbolic and Algebraic Manipulation, Numeric Computing, Algebra, Algorithm Analysis and Problem Complexity