menu

Introduction to Lattice Theory with Computer Science Applications
by Vijay K. Garg




Overview -
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.

  Read Full Product Description
 
local_shippingFor Delivery
In Stock.
This item is Non-Returnable.
FREE Shipping for Club Members help
 
storeBuy Online Pickup At Store
search store by zipcode

 
 
New & Used Marketplace 5 copies from $95.84
 
 
 

More About Introduction to Lattice Theory with Computer Science Applications by Vijay K. Garg

 
 
 

Overview

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.



This item is Non-Returnable.

 

Details

  • ISBN-13: 9781118914373
  • ISBN-10: 1118914376
  • Publisher: Wiley
  • Publish Date: May 2015
  • Page Count: 272
  • Dimensions: 9.3 x 6.2 x 0.9 inches
  • Shipping Weight: 1.3 pounds


Related Categories

 

BAM Customer Reviews