00904nam0-22003131i-450-99000057851040332120001010000057851FED01000057851(Aleph)000057851FED0100005785120001010d--------km-y0itay50------baitay-------001yyTHERMODYNAMICS OF IRREVERSIBLE PROCESSESDE GROOT S.R.s.l.s.e.s.d.Teoria e pratica delle Costruzioni civili e industrialiMateriali da CostruzioneCostruzioni di MacchineMeccanica RazionaleGroot,Sybren Ruurds de17795ITUNINARICAUNIMARCBK99000057851040332107 B-150DINSCDINSCThermodynamics of irreversible processes129897UNINAING0103148nam 22005773 450 991101941830332120250203110103.0978139424981713942498109781394249794139424979997813942498001394249802(CKB)37084502200041(MiAaPQ)EBC31867375(Au-PeEL)EBL31867375(CaSebORM)9781394249787(OCoLC)1482237085(OCoLC-P)1482237085(Perlego)4772730(EXLCZ)993708450220004120250102d2025 uy 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierApplied Satisfiability Cryptography, Scheduling, and Coalitional Games1st ed.Newark :John Wiley & Sons, Incorporated,2025.©2025.1 online resource (275 pages)9781394249787 1394249780 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.Boolean logicData encryption (Computer science)Program transformation (Computer programming)Boolean logicData encryption (Computer science)Program transformation (Computer programming)006.3Liao Xiaojuan1839998Koshimura Miyuki1839999MiAaPQMiAaPQMiAaPQBOOK9911019418303321Applied Satisfiability4419454UNINA