Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Branching Programs and Binary Decision Diagrams

Name: Branching Programs and Binary Decision Diagrams
Brand: Society for Industrial & Applied Mathematics,U.S.
SKU: 02050101
Availability: OutOfStock
Author: Ingo Wegener
ISBN: 9780898714586

Theory and Applications

Ingo Wegener

Language

English

Book Hardback

Libristo code: 02050101

Publishers Society for Industrial & Applied Mathematics,U.S., July 2000

Finite functions (in particular, Boolean functions) play a fundamental role in computer science and... Full description

Libristo code: 02050101

Customers also purchased

Formzahlen und Massentafeln für die Kiefer Adam Schwappach

Paperback

5 204 Ft

Akt małżeński Knotz Ksawery

Audio CD

2 202 Ft

Das Schoene Gertrud Mertens

Paperback

20 337 Ft

Tassulan lasten iltasatukirja Mauri Kunnas

Hardback

4 956 Ft

Ewangelia Tomasza Leloup Jean-Yves

Paperback

3 599 Ft

Trötsch Der kleine Maulwurf Zaubermalspaß mit Wasserstift Malblock Trötsch Verlag

Paperback

2 800 Ft

Zwierzaki. Maluszkowe malowanie Opracowanie zbiorowe

Paperback

221 Ft

Procédures fiscales 11ed Philippe Marchessou

Paperback

12 986 Ft

Jak przestać się martwić i zacząć żyć wyd. 2022 Dale Carnegie

Paperback

3 701 Ft

Ibn Khaldun. I grandi personaggi. Ediz. italiana e araba Fatima Sharafeddine

Hardback

4 868 Ft

DISNEY - Mes Premières Chansons pour faire la fête

binding.

7 185 Ft

Lerntheke - Englisch Ingrid Preedy

Sheet

8 500 Ft

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.