Branching Programs Binary Decision by Wegener Ingo (16 results)

Hardcover. Condition: Brand New. 408 pages. 9.00x6.00x1.00 inches. In Stock.

Condition: New.

Condition: New. 1987. Hardcover. . . . . .

Condition: As New. Unread book in perfect condition.

Condition: New.

HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

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.…

Condition: As New. Unread book in perfect condition.

Hardback. Condition: New. New copy - Usually dispatched within 4 working days.

Condition: New. 1987. Hardcover. . . . . . Books ship from the US and Ireland.

Condition: New. KlappentextThis is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations.

Condition: New. In English.

Buch. Condition: Neu. Neuware - This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations.

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.…

Condition: Sehr gut. Zustand: Sehr gut | Seiten: 418 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Hardcover. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.