Applied satisfiability: cryptography, scheduling, and coalitional games

By: Liao, Xiaojuan [Author] | Koshimura, Miyuki [Author]Material type: Text

TextLanguage: English Publication details: New Jersey: Wiley Data and Cybersecurity, 2025. Description: ix, 257pISBN: 9781394249800Subject(s): SAT Encoding for AES Partial Key Recovery | MaxSAT Encoding for AES Partial Key Recovery | Job‐Shop Scheduling and Overloaded SchedulingDDC classification: 006.3 Online resources: Click here to access online

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 1 )

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
e-Books	Dr. S. R. Ranganathan Library Ebook (Online Access)	006.3 (Online Access) (Browse shelf(Opens below))	Available		EB0039

Browsing Dr. S. R. Ranganathan Library shelves, Shelving location: Ebook (Online Access) Close shelf browser (Hides shelf browser)

Previous								Next
Previous	006.3 Intelligent data analysis: from data gathering to data comprehension	006.3 Machine learning theory and applications: hands-on use cases with python on classical and quantum machines	006.3 Making sense of data I: A practical guide to exploratory data analysis and data mining	006.3 (Online Access) Applied satisfiability: cryptography, scheduling, and coalitional games	006.3 (Online Access) Automation and computational intelligence for road maintenance and management: advances and applications	006.305 Deep learning: from big data to artificial intelligence with R	006.31 Machine learning techniques and analytics for cloud security	Next

Apply satisfiability to a range of difficult problems

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.

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.

Applied Satisfiability readers will also find:

Coding and problem-solving skills applicable to a variety of fields
Specific experiments and case studies that demonstrate the effectiveness of satisfiability-aided methods
Chapters covering topics including cryptographic key recovery, various forms of scheduling, coalition structure generation, and many more
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.