Complexity classifications of Boolean constraint satisfaction problems
Material type: TextSeries: SIAM monographs on discrete mathematics and applicationsPublication details: Philadelphia : Society for Industrial and Applied Mathematics, ©2001.Description: xii, 106 p. ; 26 cmISBN:- 9780898714791
- 511.3 21 CRE-C
- QA267.7 .C74 2001
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
Books | IIITD Reference | Mathematics | REF 511.3 CRE-C (Browse shelf(Opens below)) | Available | 003625 |
Total holds: 0
Browsing IIITD shelves, Shelving location: Reference, Collection: Mathematics Close shelf browser (Hides shelf browser)
REF 511.3 BEN-M Mathematical logic for computer science | REF 511.3 BER-H Handbook of process algebra | REF 511.3 BIE-H Handbook of satisfiability | REF 511.3 CRE-C Complexity classifications of Boolean constraint satisfaction problems | REF 511.3 CUN-L A logical introduction to proof | REF 511.3 CUR-F Foundations of mathematical logic | REF 511.3 DAL-L Logic and structure |
Includes bibliographical references (p. 97-102) and index.
There are no comments on this title.