This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations.
"synopsis" may belong to another edition of this title.
This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. Efficient algorithms for operations on these representations are presented, and the limits of those techniques are considered.
"About this title" may belong to another edition of this title.
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 408 pages. 9.00x6.00x1.00 inches. In Stock. Seller Inventory # __0898714583
Quantity: 2 available
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. 1987. Hardcover. . . . . . Seller Inventory # V9780898714586
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 773689-n
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 773689-n
Quantity: 2 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 773689
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FW-9780898714586
Quantity: 2 available
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Hardback. Condition: New. 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. Seller Inventory # LU-9780898714586
Quantity: 1 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 773689
Quantity: 2 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. New copy - Usually dispatched within 4 working days. Seller Inventory # B9780898714586
Quantity: 1 available
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. 1987. Hardcover. . . . . . Books ship from the US and Ireland. Seller Inventory # V9780898714586