Introduction to Lattice Theory with Computer Science Applications
eBook - ePub

Introduction to Lattice Theory with Computer Science Applications

  1. English
  2. ePUB (mobile friendly)
  3. Available on iOS & Android
eBook - ePub

Introduction to Lattice Theory with Computer Science Applications

About this book

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.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Introduction to Lattice Theory with Computer Science Applications by Vijay K. Garg in PDF and/or ePUB format, as well as other popular books in Computer Science & Parallel Programming. We have over one million books available in our catalogue for you to explore.

Information

Table of contents

  1. Cover
  2. Title Page
  3. Copyright
  4. Table of Contents
  5. Dedication
  6. List Of Figures
  7. Nomenclature
  8. Preface
  9. Chapter 1: Introduction
  10. Chapter 2: Representing Posets
  11. Chapter 3: Dilworth's Theorem
  12. Chapter 4: Merging Algorithms
  13. Chapter 5: Lattices
  14. Chapter 6: Lattice Completion
  15. Chapter 7: Morphisms
  16. Chapter 8: Modular Lattices
  17. Chapter 9: Distributive Lattices
  18. Chapter 10: Slicing
  19. Chapter 11: Applications of Slicing to Combinatorics
  20. Chapter 12: Interval Orders
  21. Chapter 13: Tractable posets
  22. Chapter 14: Enumeration Algorithms
  23. Chapter 15: Lattice of Maximal Antichains
  24. Chapter 16: Dimension Theory
  25. Chapter 17: Fixed Point Theory
  26. Bibliography
  27. Index
  28. End User License Agreement