Le livre est actuellement en rupture de stock
En savoir plus sur le livre
The book offers an in-depth exploration of fundamental lower-bounds arguments in computational complexity, highlighting significant discoveries from the past twenty years, including the latest findings. It encompasses a diverse range of models, such as circuits, formulas, communication protocols, and branching programs, providing a thorough understanding of these critical concepts in theoretical computer science.
Achat du livre
Boolean Function Complexity, Stasys Jukna
- Langue
- Année de publication
- 2012
- product-detail.submit-box.info.binding
- (rigide)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.
Modes de paiement
Il manque plus que ton avis ici.