- 5 Ergebnisse
Kleinster Preis: € 54,00, größter Preis: € 70,00, Mittelwert: € 62,88
1
Relations and Graphs. Discrete Mathematics for Computer Scientists. - Schmidt, Gunther.
Bestellen
bei ZVAB.com
€ 54,40
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Schmidt, Gunther.:

Relations and Graphs. Discrete Mathematics for Computer Scientists. - gebunden oder broschiert

1993, ISBN: 3540562540

[EAN: 9783540562542], Gebraucht, sehr guter Zustand, [SC: 0.0], [PU: Springer. Berlin/Heidelberg.], MODERNES ANTIQUARIAT. - NATURWISSENSCHAFT., ALGEBRA; COMPUTER; MATHEMATIK; NATURWISSENS… Mehr…

NOT NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) avelibro OHG, Dinkelscherben, Germany [72099711] [Rating: 5 (von 5)]
zuklappen (X)
2
Relations and Graphs. Discrete Mathematics for Computer Scientists. - Schmidt, Gunther.
Bestellen
bei booklooker.de
€ 68,00
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link

Schmidt, Gunther.:

Relations and Graphs. Discrete Mathematics for Computer Scientists. - gebrauchtes Buch

1993, ISBN: 9783540562542

[PU: Springer. Berlin/Heidelberg.], VIII, 301 P. 24 x 16 cm. Original Hardboard. Inside with owner notice on book end paper, a few pages with yellow and orange pencil underline, otherwise… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) avelibro OHG
zuklappen (X)
3
Relations and Graphs. Discrete Mathematics for Computer Scientists. - Schmidt, Gunther.
Bestellen
bei buchfreund.de
€ 68,00
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Schmidt, Gunther.:
Relations and Graphs. Discrete Mathematics for Computer Scientists. - gebrauchtes Buch

1993

ISBN: 9783540562542

VIII, 301 P. 24 x 16 cm. Original Hardboard. Inside with owner notice on book end paper, a few pages with yellow and orange pencil underline, otherwise in very good condition. English Lan… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) avelibro OHG, 86424 Dinkelscherben
zuklappen (X)
4
Relations and Graphs. Discrete Mathematics for Computer Scientists. - Schmidt, Gunther.
Bestellen
bei Achtung-Buecher.de
€ 70,00
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Schmidt, Gunther.:
Relations and Graphs. Discrete Mathematics for Computer Scientists. - gebrauchtes Buch

1993, ISBN: 3540562540

24 x 16 cm. Original Hardboard. VIII, 301 P. Unbekannter Einband Inside with owner notice on book end paper, a few pages with yellow and orange pencil underline, otherwise in very good c… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) avelibro OHG, 86424 Dinkelscherben
zuklappen (X)
5
Relations and Graphs. Discrete Mathematics for Computer Scientists. With 203 Figures. [= EATCS Monographs on Theoretical Computer Science]. - Schmidt, Gunther; Ströhlein, Thomas
Bestellen
bei booklooker.de
€ 54,00
Versand: € 5,001
Bestellen
Details beim Anbieter
gesponserter Link
Schmidt, Gunther; Ströhlein, Thomas:
Relations and Graphs. Discrete Mathematics for Computer Scientists. With 203 Figures. [= EATCS Monographs on Theoretical Computer Science]. - gebrauchtes Buch

1993, ISBN: 9783540562542

[PU: Berlin - Heidelberg - New York u. a., Springer-Verlag, (1993)], Original-Pappband; Gr. 8°; viii (ii) 301 (9) Seiten. Sehr gutes Exemplar. EATCS Monographs on Theoretical Computer Sci… Mehr…

Versandkosten:Versand nach Deutschland. (EUR 5.00) Antiquariat Fluck
zuklappen (X)
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Relations and Graphs: Discrete Mathematics for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series)
Autor:
Titel:
ISBN-Nummer:

3540562540


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.

Detailangaben zum Buch - Relations and Graphs: Discrete Mathematics for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series)


EAN (ISBN-13): 9783540562542
ISBN (ISBN-10): 3540562540
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1993
Herausgeber: Springer

Buch in der Datenbank seit 2007-06-01T13:05:56+02:00 (Berlin)
Detailseite zuletzt geändert am 2023-05-28T18:07:31+02:00 (Berlin)
ISBN/EAN: 3540562540

ISBN - alternative Schreibweisen:
3-540-56254-0, 978-3-540-56254-2
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: gunther schmidt, schmidt thomas, str, schmidt günther
Titel des Buches: discrete mathematics for computer scientists, relations and graphs

Daten vom Verlag:

Autor/in: Gunther Schmidt; Thomas Ströhlein
Titel: Monographs in Theoretical Computer Science. An EATCS Series; Relations and Graphs - Discrete Mathematics for Computer Scientists
Verlag: Springer; Springer Berlin
301 Seiten
Erscheinungsjahr: 1993-04-15
Berlin; Heidelberg; DE
Gewicht: 0,625 kg
Sprache: Englisch
85,55 € (DE)
87,95 € (AT)
106,60 CHF (CH)
Not available, publisher indicates OP

BB; Book; Hardcover, Softcover / Informatik, EDV/Informatik; Rechnerarchitektur und Logik-Entwurf; Verstehen; mathematics; algorithms; discrete mathematics; graphs; programming language; design; computer science; concurrency; Programmiersprache; logic; semantics; computer; graph theory; programming; language; B; Logic Design; Computer Science; Combinatorics; Logics and Meanings of Programs; Software Engineering; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations; Kombinatorik und Graphentheorie; Computerprogrammierung und Softwareentwicklung; Rechnerarchitektur und Logik-Entwurf; Software Engineering; Künstliche Intelligenz; Robotik; Mathematische Grundlagen; Mathematik: Logik; BC; EA

1. Sets.- 2. Homogeneous Relations.- 2.1 Boolean Operations on Relations.- 2.2 Transposition of a Relation.- 2.3 The Product of Two Relations.- 2.4 Subsets and Points.- 2.5 References.- 3. Transitivity.- 3.1 Orderings and Equivalence Relations.- 3.2 Closures and Closure Algorithms.- 3.3 Extrema, Bounds, and Suprema.- 3.4 References.- 4. Heterogeneous Relations.- 4.1 Bipartite Graphs.- 4.2 Functions and Mappings.- 4.3 n-ary Relations in Data Bases.- 4.4 Difunctionality.- 4.5 References.- 5. Graphs: Associated Relation, Incidence, Adjacency.- 5.1 Directed Graphs.- 5.2 Graphs via the Associated Relation.- 5.3 Hypergraphs.- 5.4 Graphs via the Adjacency Relation.- 5.5 Incidence and Adjacency.- 5.6 References.- 6. Reachability.- 6.1 Paths and Circuits.- 6.2 Chains and Cycles.- 6.3 Terminality and Foundedness.- 6.4 Confluence and Church-Rosser Theorems.- 6.5 Hasse Diagrams and Discreteness.- 6.6 References.- 7. The Category of Graphs.- 7.1 Homomorphisms of 1-Graphs.- 7.2 More Graph Homomorphisms.- 7.3 Covering of Graphs and Path Equivalence.- 7.4 Congruences.- 7.5 Direct Product and n-ary Relations.- 7.6 References.- 8. Kernels and Games.- 8.1 Absorptiveness and Stability.- 8.2 Kernels.- 8.3 Games.- 8.4 References.- 9. Matchings and Coverings.- 9.1 Independence.- 9.2 Coverings.- 9.3 Matching Theorems.- 9.4 Starlikeness.- 9.5 References.- 10. Programs: Correctness and Verification.- 10.1 Programs and Their Effect.- 10.2 Partial Correctness and Verification.- 10.3 Total Correctness and Termination.- 10.4 Weakest Preconditions.- 10.5 Coverings of Programs.- 10.6 References.- General References.- Name Index.- Table of Symbols.
This book explains how to use relational and graph-theoretic methods systematically in computer science. Results are first motivated by practical examples and then derived algebraically.
< zum Archiv...