Relations and Graphs Discrete Mathematics for Computer Scientists
-
- Englisch ausgewählt
Fr. 137.00
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
16.01.2012
Verlag
Springer BerlinSeitenzahl
301
Maße (L/B/H)
23.5/15.5/1.8 cm
Gewicht
487 g
Auflage
Softcover reprint of the original 1st ed. 1993
Sprache
Englisch
ISBN
978-3-642-77970-1
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.
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.
Noch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.