Algebra for computer science (Q1188514)

The book covers in a very short (ca. 200 pages) and compact manner the basics of the algebraic disciplines: Number theory, modules, finite Fourier transform, rings and fields, polynomial rings and algebraic extensions, groups, Boolean algebra, and semigroups. As applications in computer science the subjects complexity, public key systems, pseudo-random numbers, linear recursion, coding, switching functions, automata, and languages are mentioned. The book impresses by very elegant and slick proofs. Since the book is written in such a very compact way, a non mathematician might have problems following all the arguments, even more so, since many arguments are left to the reader as exercises. As a reference to algebraic facts relevant to computer science the book is an excellent choice, however, the uninitiated reader might have serious difficulties when using it as an introduction to algebra because of the brevity of the arguments.