logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Boolean Function Complexity Advances And Frontiers 1st Edition Stasys Jukna Auth

  • SKU: BELL-2503234
Boolean Function Complexity Advances And Frontiers 1st Edition Stasys Jukna Auth
$ 31.00 $ 45.00 (-31%)

4.7

26 reviews

Boolean Function Complexity Advances And Frontiers 1st Edition Stasys Jukna Auth instant download after payment.

Publisher: Springer-Verlag Berlin Heidelberg
File Extension: PDF
File size: 7.64 MB
Pages: 620
Author: Stasys Jukna (auth.)
ISBN: 9783642245077, 3642245072
Language: English
Year: 2012
Edition: 1

Product desciption

Boolean Function Complexity Advances And Frontiers 1st Edition Stasys Jukna Auth by Stasys Jukna (auth.) 9783642245077, 3642245072 instant download after payment.

Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.

Related Products