Kontakt
Jak kupować
Dostawa
Doradca ds. zakupów
Angielski
381 b
Zapowiedź
Wydanie 12. 06. 2026
30 dni na zwrot towaru
Klienci kupili także
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.
Informacje o książce
Angielski
Podaruj tę książkę jeszcze dziś
To łatwe
1 Dodaj książkę do koszyka i wybierz „dostarczyć jako prezent” 2 W odpowiedzi wyślemy Ci bon 3 Książka dotrze na adres obdarowanegoMogłoby Cię także zainteresować
/
Miękka
102.27
zł
/
Miękka
70.05
zł
Cześć! Jestem Libroamiko, Twój doradca książkowy.
Jak mogę Ci pomóc?