
Download App
>> | LShop | >> | Book | >> | Computing & Informat... | >> | Computer Programming... | >> | Boolean Function Com... |
ISBN
:
9783642245077
Publisher
:
Springer
Subject
:
Computer Programming / Software Development, Mathematics
Binding
:
HARDCOVER
Pages
:
632
Year
:
2012
₹
10235.0
₹
9825.0
Buy Now
Shipping charges are applicable for books below Rs. 101.0
View Details(Imported Edition) Estimated Shipping Time : 25-28 Business Days
View DetailsDescription
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 xA0;description of basic lower bound arguments, covering many of the gems of this x201C;complexity Waterloox201D; 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.
Author Biography
http://www.thi.informatik.uni-frankfurt.de/~jukna/
Related Items
-
of
Are you sure you want to remove the item from your Bag?
Yes
No
Added to Your Wish List
OK
Your Shopping Bag
- 2 Items
Item
Delivery
Unit Price
Quantity
Sub Total
Order Summary