000 04183cam a2200757 i 4500
001 ocn904047561
003 OCoLC
005 20171025094236.0
006 m o d
007 cr |||||||||||
008 150224s2015 nju ob 001 0 eng
010 _a 2015007773
020 _a9781119069713
_qelectronic bk.
020 _a1119069718
_qelectronic bk.
020 _z9781119069737
020 _z1119069734
020 _z9781118914373 (cloth)
020 _z9781119069706
020 _z111906970X
020 _z1118914376
029 1 _aDEBSZ
_b449476510
029 1 _aDEBSZ
_b45217399X
029 1 _aDEBBG
_bBV043397563
029 1 _aDEBSZ
_b480366772
035 _a(OCoLC)904047561
_z(OCoLC)928712410
_z(OCoLC)942670585
037 _aCL0500000671
_bSafari Books Online
040 _aDLC
_beng
_erda
_cDLC
_dOCLCF
_dDG1
_dEBLCP
_dYDXCP
_dCOO
_dUMI
_dDEBSZ
_dOCLCQ
_dN$T
_dIDEBK
_dCDX
_dOCLCQ
_dKSU
_dVT2
_dRECBK
042 _apcc
049 _aMAIN
050 0 0 _aQA76.9.L38
072 7 _aCOM
_x013000
_2bisacsh
072 7 _aCOM
_x014000
_2bisacsh
072 7 _aCOM
_x018000
_2bisacsh
072 7 _aCOM
_x067000
_2bisacsh
072 7 _aCOM
_x032000
_2bisacsh
072 7 _aCOM
_x037000
_2bisacsh
072 7 _aCOM
_x052000
_2bisacsh
082 0 0 _a004.01/51
_223
100 1 _aGarg, Vijay K.
_q(Vijay Kumar),
_d1963-
245 1 0 _aIntroduction to lattice theory with computer science applications /
_cVijay K. Garg.
_h[electronic resource]
264 1 _aHoboken, New Jersey :
_bWiley,
_c[2015]
300 _a1 online resource.
336 _atext
_2rdacontent
337 _acomputer
_2rdamedia
338 _aonline resource
_2rdacarrier
504 _aIncludes bibliographical references and index.
520 _aA 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.
588 _aDescription based on print version record and CIP data provided by publisher.
650 0 _aComputer science
_xMathematics.
650 0 _aEngineering mathematics.
650 0 _aLattice theory.
650 7 _aComputer science
_xMathematics.
_2fast
_0(OCoLC)fst00872460
650 7 _aEngineering mathematics.
_2fast
_0(OCoLC)fst00910601
650 7 _aLattice theory.
_2fast
_0(OCoLC)fst00993426
650 7 _aCOMPUTERS / Computer Literacy
_2bisacsh
650 7 _aCOMPUTERS / Computer Science
_2bisacsh
650 7 _aCOMPUTERS / Data Processing
_2bisacsh
650 7 _aCOMPUTERS / Hardware / General
_2bisacsh
650 7 _aCOMPUTERS / Information Technology
_2bisacsh
650 7 _aCOMPUTERS / Machine Theory
_2bisacsh
650 7 _aCOMPUTERS / Reference
_2bisacsh
655 4 _aElectronic books.
776 0 8 _iPrint version:
_aGarg, Vijay K. (Vijay Kumar), 1963-
_tIntroduction to lattice theory with computer science applications
_dHoboken, New Jersey : John Wiley & Sons, Inc., [2015]
_z9781118914373
_w(DLC) 2015003602
856 4 0 _uhttp://onlinelibrary.wiley.com/book/10.1002/9781119069706
_zWiley Online Library
942 _2ddc
_cBK
999 _c207910
_d207910