Name: Branching Programs and Binary Decision Diagrams. Theory and Applications (en Inglés)
SKU: 67595337
Price: 200.36 USD
Availability: InStock
Author: Ingo Wegener

portada Branching Programs and Binary Decision Diagrams. Theory and Applications (en Inglés)

Branching Programs and Binary Decision Diagrams. Theory and Applications (en Inglés)

Formato

Libro Físico

Editorial

SIAM - Society for Industrial and Applied Mathematics

Autor

Ingo Wegener

Colección

SIAM Monographs on Discrete Mathematics and Applications

Año

2000

Idioma

Inglés

N° páginas

418

Encuadernación

Tapa Dura

Dimensiones

22.8x15.1x2.6 cm

ISBN13

9780898714586

Branching Programs and Binary Decision Diagrams. Theory and Applications (en Inglés)

Ingo Wegener (Autor) · SIAM - Society for Industrial and Applied Mathematics · Tapa Dura

Libro Nuevo Importado

Envío: 26 a 33 días háb.

$ 364.29$ 200.36

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 2 unidades

$ 200.36

Llega entre el 23 Sep y el 06 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Branching Programs and Binary Decision Diagrams. Theory and Applications (en Inglés)"

Describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. This book is the first comprehensive description of theory and applications.

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.