TY  - BOOK
AU  - Garg, Vijay K.
TI  - Introduction to lattice theory with computer science applications
SN  - 9781119069
AV  - QA76.9.L38 
U1  - 004.01/51 23
PY  - 2015///]
CY  - Hoboken, New Jersey
PB  - Wiley
KW  - Computer science
KW  - Mathematics
KW  - Engineering mathematics
KW  - Lattice theory
KW  - fast
KW  - COMPUTERS / Computer Literacy
KW  - bisacsh
KW  - COMPUTERS / Computer Science
KW  - COMPUTERS / Data Processing
KW  - COMPUTERS / Hardware / General
KW  - COMPUTERS / Information Technology
KW  - COMPUTERS / Machine Theory
KW  - COMPUTERS / Reference
KW  - Electronic books
N1  - Includes bibliographical references and index
N2  - 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 is for readers to learn not only the proofs, but the heuristics that guide said proofs. Introduction to Lattice Theory with Computer Science Applications: -Examines; posets, Dilworth's theorem, merging algorithms, lattices, lattice completion, morphisms, modular and distributive lattices, slicing, interval orders, tractable posets, lattice enumeration algorithms, and dimension theory -Provides end of chapter exercises to help readers retain newfound knowledge on each subject -Includes supplementary material at www.ece.uTexas.edu/garg Introduction to Lattice Theory with Computer Science Applications is written for students of computer science, as well as practicing mathematicians
UR  - http://onlinelibrary.wiley.com/book/10.1002/9781119069706
ER  -