Boolean Function Complexity
☆☆☆☆☆
(0 reviews)
Lowest price (incl. delivery)
9 170,00 JPY
Typical price3 097,42 PLN
Lowest (90 days)55,99 PLN
Offers2
Last updated3 zile în urmă
| Vânzător | Product price | Delivery | Total | Disponibilitate | Updated | |
|---|---|---|---|---|---|---|
| SP Springer Nature Author | 9 151,00 JPY | 19,00 JPY | 9 170,00 JPY | Disponibil | 3 zile în urmă | View offer |
| SP SpringerNatureLink Shop INT | 75,50 EUR | free | 75,50 EUR | Disponibil | 3 zile în urmă | View offer |
Prețurile și disponibilitatea se pot modifica. Ultima actualizare: 08.08.2026 23:18.
EAN
9783642245084
Springer Nature
0,0
☆☆☆☆☆
0 reviews
5★
0%
4★
0%
3★
0%
2★
0%
1★
0%
Product reviews
No reviews yet — be the first!
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.
Similar products
Patient Safety Coaching
from $91.97
Ethnography and Diversity
from $69.30
Smart Villages
from $91.97
Nuclear Non-Proliferation in International Law - Volume VI
from $91.97
The Price of Freedom
from $91.97
Eco-Social Policy in the OECD and the World Bank
from $91.97
Special Topics in Policing
from $122.58
Music from the Heart
from $91.97