Applied Satisfiability : Cryptography, Scheduling, and Coalitional Games.

Format:

Book

Author/Creator:

Liao, Xiaojuan.

Contributor:

Koshimura, Miyuki.

Language:

English

Subjects (All):

Boolean logic.

Data encryption (Computer science).

Program transformation (Computer programming).

Physical Description:

1 online resource (275 pages)

Edition:

1st ed.

Place of Publication:

Wiley 2024

Summary:

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.

Contents:

Chapter 1 Satisfiability Theories Chapter 2 Encoding in General Chapter 3 SAT Encoding for AES Partial Key Recovery Chapter 4 MaxSAT Encoding for AES Partial Key Recovery Chapter 5 Job‐Shop Scheduling Chapter 6 Overloaded Scheduling Chapter 7 Restricted Preemptive Scheduling Chapter 8 Rule Relation‐Based Weighted Partial MaxSAT (RWPM) Encoding Chapter 9 Agent Relation‐Based Weighted Partial MaxSAT (AWPM) Encoding Chapter 10 Comparative Analysis and Improvement of RWPM Chapter 11 Improved Rule Relation‐Based WPM (I‐RWPM) EULA

Notes:

Description based on publisher supplied metadata and other sources.

ISBN:

9781394249817

1394249810

9781394249794

1394249799

9781394249800

1394249802

OCLC:

1482237085