Introduction to lattice theory with computer science applications /
Garg, Vijay K. 1963-
Introduction to lattice theory with computer science applications / Vijay K. Garg. - 1 online resource.
Includes bibliographical references and index.
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.
9781119069713 1119069718
CL0500000671 Safari Books Online
2015007773
Computer science--Mathematics.
Engineering mathematics.
Lattice theory.
Computer science--Mathematics.
Engineering mathematics.
Lattice theory.
COMPUTERS / Computer Literacy
COMPUTERS / Computer Science
COMPUTERS / Data Processing
COMPUTERS / Hardware / General
COMPUTERS / Information Technology
COMPUTERS / Machine Theory
COMPUTERS / Reference
Electronic books.
QA76.9.L38
004.01/51
Introduction to lattice theory with computer science applications / Vijay K. Garg. - 1 online resource.
Includes bibliographical references and index.
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.
9781119069713 1119069718
CL0500000671 Safari Books Online
2015007773
Computer science--Mathematics.
Engineering mathematics.
Lattice theory.
Computer science--Mathematics.
Engineering mathematics.
Lattice theory.
COMPUTERS / Computer Literacy
COMPUTERS / Computer Science
COMPUTERS / Data Processing
COMPUTERS / Hardware / General
COMPUTERS / Information Technology
COMPUTERS / Machine Theory
COMPUTERS / Reference
Electronic books.
QA76.9.L38
004.01/51