Applied Satisfiability
eBook - PDF

Applied Satisfiability

Cryptography, Scheduling, and Coalitional Games

  1. 275 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Applied Satisfiability

Cryptography, Scheduling, and Coalitional Games

About this book

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.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, weā€™ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere ā€” even offline. Perfect for commutes or when youā€™re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Applied Satisfiability by Xiaojuan Liao,Miyuki Koshimura in PDF and/or ePUB format, as well as other popular books in Mathematics & Computer Science General. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Wiley
Year
2024
Print ISBN
9781394249787
eBook ISBN
9781394249800
Edition
1
Topic
Mathematics
Subtopic
Computer Science General
Index
Mathematics

Table of contents

  1. Cover
  2. Title Page
  3. Copyright
  4. Contents
  5. Preface
  6. Chapter 1 Satisfiability Theories
  7. Chapter 2 Encoding in General
  8. Chapter 3 SAT Encoding for AES Partial Key Recovery
  9. Chapter 4 MaxSAT Encoding for AES Partial Key Recovery
  10. Chapter 5 Jobā€Shop Scheduling
  11. Chapter 6 Overloaded Scheduling
  12. Chapter 7 Restricted Preemptive Scheduling
  13. Chapter 8 Rule Relationā€Based Weighted Partial MaxSAT (RWPM) Encoding
  14. Chapter 9 Agent Relationā€Based Weighted Partial MaxSAT (AWPM) Encoding
  15. Chapter 10 Comparative Analysis and Improvement of RWPM
  16. Chapter 11 Improved Rule Relationā€Based WPM (Iā€RWPM)
  17. Appendix A Complete File for Solving 4ā€Queens in DIMACS Format
  18. Appendix B A Sample of Sbox Expressed in ANF
  19. Appendix C Complete File Generated by MaxSAT for Solving Overloaded Scheduling in WPM Input Format
  20. Appendix D Complete File Generated by RWPM for Example 8.9 in WPM Input Format
  21. Appendix E Complete File Generated by RWPM for Example 8.11 in WPM Input Format
  22. Appendix F Complete File Generated by RWPM for Example 8.12 in WPM Input Format
  23. Appendix G Complete File Generated by RWPM for Example 8.13 in WPM Input Format
  24. Appendix H Complete File Generated by AWPM for Example 9.2 in WPM Input Format
  25. Appendix I Complete File Generated by AWPM for Example 9.3 in WPM Input Format
  26. Appendix J Complete File Generated by AWPM for Example 9.4 in WPM Input Format
  27. Appendix K Complete File Generated by AWPM for Example 9.5 in WPM Input Format
  28. Appendix L Proof of Formula in Lemma 10.3
  29. Appendix M Calculation of mā€¾ in Chapter 10
  30. Appendix N Complete File Generated by RWPMā€RT for Example 10.3 in WPM Input Format
  31. Appendix O Complete File Generated by RWPMā€RT for Example 10.4 in WPM Input Format
  32. Appendix P Comparative Analysis of RWPM and Iā€RWPM
  33. Appendix Q Complete File Generated by Iā€RWPM for Example 11.3 in WPM Input Format
  34. Appendix R Complete Files Generated by Iā€RWPM and RWPMā€RT for Example 11.4 in WPM Input Format
  35. Appendix S Theoretical Analysis on d
  36. Index
  37. EULA