Boolean Function Complexity
☆☆☆☆☆
(0 opinii)
Najniższa cena (z dostawą)
9 170,00 JPY
Typowa cena3 097,42 PLN
Najniższa (90 dni)55,99 PLN
Liczba ofert2
Ostatnia aktualizacja3 dni temu
| Sprzedawca | Cena produktu | Dostawa | Razem | Dostępność | Aktualizacja | |
|---|---|---|---|---|---|---|
| SP Springer Nature Author | 9 151,00 JPY | 19,00 JPY | 9 170,00 JPY | Dostępny | 3 dni temu | Zobacz ofertę |
| SP SpringerNatureLink Shop INT | 75,50 EUR | 0 zł | 75,50 EUR | Dostępny | 3 dni temu | Zobacz ofertę |
Ceny i dostępność mogą ulec zmianie. Ostatnia aktualizacja: 08.08.2026 23:18.
EAN
9783642245084
Springer Nature
0,0
☆☆☆☆☆
0 opinii
5★
0%
4★
0%
3★
0%
2★
0%
1★
0%
Opinie o produkcie
Brak opinii — bądź pierwszy!
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.
Podobne produkty
Patient Safety Coaching
od $91.97
Ethnography and Diversity
od $69.30
Smart Villages
od $91.97
Nuclear Non-Proliferation in International Law - Volume VI
od $91.97
The Price of Freedom
od $91.97
Eco-Social Policy in the OECD and the World Bank
od $91.97
Special Topics in Policing
od $122.58
Music from the Heart
od $91.97