Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 128,27
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 132,58
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 121,01
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 127,53
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 133,17
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Sprache: Englisch
Verlag: John Wiley and Sons Inc, US, 2024
ISBN 10: 1394249780 ISBN 13: 9781394249787
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
EUR 163,04
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHardback. Zustand: 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.
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 256 1st edition NO-PA16APR2015-KAP.
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Erstausgabe
EUR 162,62
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. 2024. 1st Edition. hardcover. . . . . .
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 200,96
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. 2024. 1st Edition. hardcover. . . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: John Wiley and Sons Inc, US, 2024
ISBN 10: 1394249780 ISBN 13: 9781394249787
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
EUR 152,89
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHardback. Zustand: 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.