img Leseprobe Leseprobe

Applied Satisfiability

Cryptography, Scheduling, and Coalitional Games

Miyuki Koshimura, Xiaojuan Liao

PDF
125,99 €
Amazon iTunes Thalia.de Hugendubel Bücher.de ebook.de kobo Osiander Google Books Barnes&Noble bol.com Legimi yourbook.shop Kulturkaufhaus ebooks-center.de
* Affiliatelinks/Werbelinks
Hinweis: Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.

Wiley img Link Publisher

Naturwissenschaften, Medizin, Informatik, Technik / Informatik

Beschreibung

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.

Weitere Titel in dieser Kategorie
Cover Signals and Systems
Signals and Systems
Fatos Tunay Yarman Vural
123,86 €
Cover Some Future Day
Some Future Day
Marc Beckman
25,81 €

Kundenbewertungen

Schlagwörter

Boolean logic, cryptoanalysis, MaxSAT, job-shop scheduling, performance evaluation, representative algorithms, overloaded scheduling, Satisfiability, comparative analysis, CNF encoding, Boolean formulae, encoding rule relations