Opening book details…
Can I read Relations and Graphs: Discrete Mathematics for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series) on EtoBox?
Relations and Graphs: Discrete Mathematics for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series) by Gunther Schmidt, Thomas Ströhlein (auth.) is a nonfiction available to read on EtoBox.
What is Relations and Graphs: Discrete Mathematics for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series) about?
Relational methods can be found at various places in computer science, notably in data base theory, relational semantics of concurrency, relationaltype theory, analysis of rewriting systems, and modern programming language design. In addition, they appear in algorithms analysis and in the bulk of discrete mathematics taught to computer scientists. This book is devoted to the background of these methods. It explains how to use relational and graph-theoretic methods systematically in computer science. A powerful formal framework of relational algebra is developed with respect to applications to a diverse range of problem areas. Results are first motivated by practical examples, often visualized by both Boolean 0-1-matrices and graphs, and then derived algebraically. Erscheinungsdatum: 16.01.2012
Who reads Relations and Graphs: Discrete Mathematics for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series)?
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- Gunther Schmidt, Thomas Ströhlein (auth.)
- Publisher
- Springer Berlin Heidelberg : Imprint: Springer
- Published
- 1993
- Language
- EN
- ISBN
- 9783642779688
- Category
- nonfiction
- Subjects
- Mathematics, Engineering, Science
Other editions & translations
More by Gunther Schmidt, Thomas Ströhlein (auth.)
Browse all works by Gunther Schmidt, Thomas Ströhlein (auth.)
Similar books
- Stochastic Coalgebraic Logic (Monographs in Theoretical Computer Science. An EATCS Series) — Ernst-Erich Doberkat (2010)
- Words and Graphs (Monographs in Theoretical Computer Science. An EATCS Series) — Dr. Sergey Kitaev, Prof. Vadim Lozin (2015)
- Time-Dependent Scheduling (Monographs in Theoretical Computer Science. An EATCS Series) — Stanislaw Gawiejnowicz (2008)
- Polynomials: An Algorithmic Approach (discrete Mathematics And Theoretical Computer Science) — Stefanescu D. Mignotte M. (1999)
- Petri Net Algebra (Monographs in Theoretical Computer Science. An EATCS Series) — Prof. Dr. Eike Best, Prof. Dr. Raymond Devillers, Prof. Dr. Maciej Koutny (auth.) (2001)
- Modeling Time in Computing (Monographs in Theoretical Computer Science. An EATCS Series) — Carlo A. Furia, Dino Mandrioli, Angelo Morzenti, Matteo Rossi (auth.) (2012)
