Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 144.11
Quantity: Over 20 available
Add to basketCondition: New.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 149.27
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 158.82
Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Language: English
Published by John Wiley and Sons Inc, US, 2024
ISBN 10: 1394249780 ISBN 13: 9781394249787
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
US$ 189.07
Quantity: Over 20 available
Add to basketHardback. Condition: New. 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 fieldsSpecific experiments and case studies that demonstrate the effectiveness of satisfiability-aided methodsChapters 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.
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 256 1st edition NO-PA16APR2015-KAP.
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
First Edition
US$ 197.91
Quantity: Over 20 available
Add to basketCondition: New. 2024. 1st Edition. hardcover. . . . . .
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. 2024. 1st Edition. hardcover. . . . . . Books ship from the US and Ireland.
Language: English
Published by John Wiley and Sons Inc, US, 2024
ISBN 10: 1394249780 ISBN 13: 9781394249787
Seller: Rarewaves.com UK, London, United Kingdom
US$ 182.40
Quantity: Over 20 available
Add to basketHardback. Condition: New. 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 fieldsSpecific experiments and case studies that demonstrate the effectiveness of satisfiability-aided methodsChapters 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.