Introduction to lattice theory with computer science applications
A computational perspective on partial order and lattice theory, focusing on algorithms and their applications This book provides a uniform treatment of the theory and applications of lattice theory. The applications covered include tracking dependency in distributed systems, combinatorics, detect...
| Format: | eBook |
|---|---|
| Published: |
Hoboken, N.J.:
Wiley
c2015.
Hoboken, N.J. : 2015. |
| Edition: | 1st edition |
| Subjects: | |
| See on Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009629959806719 |
| Summary: | A computational perspective on partial order and lattice theory, focusing on algorithms and their applications This book provides a uniform treatment of the theory and applications of lattice theory. The applications covered include tracking dependency in distributed systems, combinatorics, detecting global predicates in distributed systems, set families, and integer partitions. The book presents algorithmic proofs of theorems whenever possible. These proofs are written in the calculational style advocated by Dijkstra, with arguments explicitly spelled out step by step. The author's intent |
|---|---|
| Item Description: | Includes bibliographical references and index |
| Physical Description: | 1 online resource (494 p.) |
| Bibliography: | Includes bibliographical references (pages 229-233) and index. |
| ISBN: | 9781119069713 9781119069737 9781119069706 |
