Applied satisfiability: cryptography, scheduling, and coalitional games (Record no. 1611)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02313nam a2200229 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20250714150429.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 250714b2025|||||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9781394249800 |
| 041 ## - LANGUAGE CODE | |
| Language code of text/sound track or separate title | English |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 006.3 |
| 100 ## - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Liao, Xiaojuan |
| Relator term | Author |
| 100 ## - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Koshimura, Miyuki |
| Relator term | Author |
| 245 ## - TITLE STATEMENT | |
| Title | Applied satisfiability: cryptography, scheduling, and coalitional games |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | New Jersey: |
| Name of publisher | Wiley Data and Cybersecurity, |
| Year of publication | 2025. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | ix, 257p. |
| 500 ## - GENERAL NOTE | |
| General note | Apply satisfiability to a range of difficult problems<br/><br/>The Boolean Satisfiability Problem (SAT) is one of the most famous and widely-studied problems in Boolean logic. Optimization versions of this problem include the Maximum Satisfiability Problem (MaxSAT) and its extensions, such as partial MaxSAT and weighted MaxSAT, which assess whether, and to what extent, a solution satisfies a given set of problems. Numerous applications of SAT and MaxSAT have emerged in fields related to logic and computing technology.<br/><br/>Applied Satisfiability: Cryptography, Scheduling, and Coalitional Games outlines some of these applications in three specific fields. It offers a huge range of SAT applications and their possible impacts, allowing readers to tackle previously challenging optimization problems with a new selection of tools. Professionals and researchers in this field will find the scope of their computational solutions to otherwise intractable problems vastly increased.<br/><br/>Applied Satisfiability readers will also find:<br/><br/>Coding and problem-solving skills applicable to a variety of fields<br/>Specific experiments and case studies that demonstrate the effectiveness of satisfiability-aided methods<br/>Chapters covering topics including cryptographic key recovery, various forms of scheduling, coalition structure generation, and many more<br/>Applied Satisfiability is ideal for researchers, graduate students, and practitioners in these fields looking to bring a new skillset to bear in their studies and careers. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | SAT Encoding for AES Partial Key Recovery |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | MaxSAT Encoding for AES Partial Key Recovery |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Job‐Shop Scheduling and Overloaded Scheduling |
| 856 ## - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://ieeexplore.ieee.org/servlet/opac?bknumber=10896971 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | e-Books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Permanent Location | Current Location | Shelving location | Full call number | Accession Number | Koha item type |
|---|---|---|---|---|---|---|---|---|---|
| Dr. S. R. Ranganathan Library | Dr. S. R. Ranganathan Library | Ebook (Online Access) | 006.3 (Online Access) | EB0039 | e-Books |