Amazon cover image
Image from Amazon.com

Introduction to lattice theory with computer science applications / Vijay K. Garg.

By: Material type: TextTextPublisher: Hoboken, New Jersey : Wiley, [2015]Description: 1 online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781119069713
  • 1119069718
Subject(s): Genre/Form: Additional physical formats: Print version:: Introduction to lattice theory with computer science applicationsDDC classification:
  • 004.01/51 23
LOC classification:
  • QA76.9.L38
Online resources: 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 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.
List(s) this item appears in: Sofware Engineering & Computer Science
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Includes bibliographical references and index.

Description based on print version record and CIP data provided by publisher.

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.

Computer Science and Engineering