Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 125,63
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 129,33
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 129,45
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 128,38
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 129,85
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por John Wiley and Sons Inc, US, 2024
ISBN 10: 1394249780 ISBN 13: 9781394249787
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 162,80
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: 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.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 169,61
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New. pp. 256 1st edition NO-PA16APR2015-KAP.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Original o primera edición
EUR 162,62
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. 2024. 1st Edition. hardcover. . . . . .
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 203,93
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. 2024. 1st Edition. hardcover. . . . . . Books ship from the US and Ireland.
Idioma: Inglés
Publicado por John Wiley and Sons Inc, US, 2024
ISBN 10: 1394249780 ISBN 13: 9781394249787
Librería: Rarewaves.com UK, London, Reino Unido
EUR 154,02
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: 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.