Skip to main content
SpringerLink
Log in
Book cover

Algebra for Computer Science

  • Textbook
  • © 1988

Overview

Authors:
  1. Lars Gårding

    1. Department of Mathematics, Lunds Universitets Matematiska Institution, Lund, Sweden

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Torbjörn Tambour

    1. Department of Mathematics, Lunds Universitets Matematiska Institution, Lund, Sweden

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Universitext (UTX)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (11 chapters)

  1. Front Matter

    Pages i-ix
    Download chapter PDF

  2. Number theory

    • Lars Gårding, Torbjörn Tambour
    Pages 1-20

  3. Number theory and computing

    • Lars Gårding, Torbjörn Tambour
    Pages 21-33

  4. Abstract algebra and modules

    • Lars Gårding, Torbjörn Tambour
    Pages 34-52

  5. The finite Fourier transform

    • Lars Gårding, Torbjörn Tambour
    Pages 53-69

  6. Rings and fields

    • Lars Gårding, Torbjörn Tambour
    Pages 70-90

  7. Algebraic complexity theory

    • Lars Gårding, Torbjörn Tambour
    Pages 91-106

  8. Polynomial rings, algebraic fields, finite fields

    • Lars Gårding, Torbjörn Tambour
    Pages 107-125

  9. Shift registers and coding

    • Lars Gårding, Torbjörn Tambour
    Pages 126-140

  10. Groups

    • Lars Gårding, Torbjörn Tambour
    Pages 141-167

  11. Boolean algebra

    • Lars Gårding, Torbjörn Tambour
    Pages 168-181

  12. Monoids, automata, languages

    • Lars Gårding, Torbjörn Tambour
    Pages 182-191

  13. Back Matter

    Pages 192-198
    Download chapter PDF
Back to top

Keywords

About this book

The aim of this book is to teach the reader the topics in algebra which are useful in the study of computer science. In a clear, concise style, the author present the basic algebraic structures, and their applications to such topics as the finite Fourier transform, coding, complexity, and automata theory. The book can also be read profitably as a course in applied algebra for mathematics students.

Authors and Affiliations

  • Department of Mathematics, Lunds Universitets Matematiska Institution, Lund, Sweden

    Lars Gårding, Torbjörn Tambour

Bibliographic Information

  • Book Title: Algebra for Computer Science

  • Authors: Lars Gårding, Torbjörn Tambour

  • Series Title: Universitext

  • DOI: https://doi.org/10.1007/978-1-4613-8797-8

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag New York Inc. 1988

  • Softcover ISBN: 978-0-387-96780-6Published: 01 August 1988

  • eBook ISBN: 978-1-4613-8797-8Published: 06 December 2012

  • Series ISSN: 0172-5939

  • Series E-ISSN: 2191-6675

  • Edition Number: 1

  • Number of Pages: IX, 198

  • Topics: Mathematical Logic and Foundations

Publish with us

Policies and ethics

Back to top

Search

Navigation