Finite functions (in particular, Boolean functions) play a fundamental role in computer science and discrete mathematics. This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. The representation size of important and selected functions is estimated, upper and lower bound techniques are studied, efficient algorithms for operations on these representations are presented, and the limits of those techniques are considered. This book is the first comprehensive description of theory and applications. Research areas like complexity theory, efficient algorithms, data structures, and discrete mathematics will benefit from the theory described in this book. The results described within have applications in verification, computer-aided design, model checking, and discrete mathematics. This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Finite functions (in particular, Boolean functions) play a fundamental role in computer science and discrete mathematics. This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. The representation size of important and selected functions is estimated, upper and lower bound techniques are studied, efficient algorithms for operations on these representations are presented, and the limits of those techniques are considered. This book is the first comprehensive description of theory and applications. Research areas like complexity theory, efficient algorithms, data structures, and discrete mathematics will benefit from the theory described in this book. The results described within have applications in verification, computer-aided design, model checking, and discrete mathematics. This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Gratuit expédition depuis Allemagne vers France
Destinations, frais et délaisEUR 3 expédition depuis Irlande vers France
Destinations, frais et délaisVendeur : Buchpark, Trebbin, Allemagne
Etat : Sehr gut. Zustand: Sehr gut | Seiten: 418 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 4007139/202
Quantité disponible : 1 disponible(s)
Vendeur : Anybook.com, Lincoln, Royaume-Uni
Etat : Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,800grams, ISBN:9780898714586. N° de réf. du vendeur 4920878
Quantité disponible : 1 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations. Series Editor(s): Hammer, Peter. Series: Monographs on Discrete Mathematics & Applications S. Num Pages: 418 pages, bibliography, index. BIC Classification: PBG; UYA. Category: (P) Professional & Vocational. Dimension: 233 x 161 x 29. Weight in Grams: 732. . 1987. Hardcover. . . . . N° de réf. du vendeur V9780898714586
Quantité disponible : 1 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 408 pages. 9.00x6.00x1.00 inches. In Stock. N° de réf. du vendeur __0898714583
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Gebunden. Etat : New. KlappentextThis is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations. N° de réf. du vendeur 1652654296
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. Etat : Neu. Neuware - This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations. N° de réf. du vendeur 9780898714586
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 773689-n
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 773689-n
Quantité disponible : 3 disponible(s)
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Etat : New. This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations. Series Editor(s): Hammer, Peter. Series: Monographs on Discrete Mathematics & Applications S. Num Pages: 418 pages, bibliography, index. BIC Classification: PBG; UYA. Category: (P) Professional & Vocational. Dimension: 233 x 161 x 29. Weight in Grams: 732. . 1987. Hardcover. . . . . Books ship from the US and Ireland. N° de réf. du vendeur V9780898714586
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 773689
Quantité disponible : 3 disponible(s)