LEADER 03148nam 22005773 450 001 9911019418303321 005 20250203110103.0 010 $a9781394249817 010 $a1394249810 010 $a9781394249794 010 $a1394249799 010 $a9781394249800 010 $a1394249802 035 $a(CKB)37084502200041 035 $a(MiAaPQ)EBC31867375 035 $a(Au-PeEL)EBL31867375 035 $a(CaSebORM)9781394249787 035 $a(OCoLC)1482237085 035 $a(OCoLC-P)1482237085 035 $a(Perlego)4772730 035 $a(EXLCZ)9937084502200041 100 $a20250102d2025 uy 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aApplied Satisfiability $eCryptography, Scheduling, and Coalitional Games 205 $a1st ed. 210 1$aNewark :$cJohn Wiley & Sons, Incorporated,$d2025. 210 4$dİ2025. 215 $a1 online resource (275 pages) 311 08$a9781394249787 311 08$a1394249780 330 $aApply 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. 606 $aBoolean logic 606 $aData encryption (Computer science) 606 $aProgram transformation (Computer programming) 615 0$aBoolean logic 615 0$aData encryption (Computer science) 615 0$aProgram transformation (Computer programming) 676 $a006.3 700 $aLiao$b Xiaojuan$01839998 701 $aKoshimura$b Miyuki$01839999 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9911019418303321 996 $aApplied Satisfiability$94419454 997 $aUNINA