Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Applied Satisfiability: Cryptography, Scheduling and Coalitional Games

by Xiaojuan Liao
Save 15% Save 15%
Current price ₹12,892.00
Original price ₹15,080.00
Original price ₹15,080.00
Original price ₹15,080.00
(-15%)
₹12,892.00
Current price ₹12,892.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9781394249787
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: Wiley
  • Publisher Imprint: Wiley
  • Publication Date:
  • Pages: 256
  • Original Price: GBP 116.0
  • Language: English
  • Edition: N/A
  • Item Weight: 390 grams
  • BISAC Subject(s): Optimization, Logic Design, and Security / Cryptography & Encryption

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.

Xiaojuan Liao, PhD, is an Associate Professor in the College of Computer and Cyber Security, Chengdu University of Technology, Chengdu, China.

Miyuki Koshimura, PhD, is an Assistant Professor in the Faculty of Information Science and Electrical Engineering, Kyushu University, Fukuoka, Japan.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us