Boolean Function Complexity: Advances and Frontiers - Stasys Jukna
-30% ar kodu BOOKS
Piegāde 17-23 darba dienu laikā
30 dienu atgriešanas politika
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 Waterloö that have been discovered over the past several decades, right up to results from the last year or two. Many open probl ... Pilns apraksts
Jums varētu patikt arī
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
AI Engineering: Building Applications with Foundation Models
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Art of Game Design: A Book of Lenses
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How To Think About AI: A Guide For The Perplexed
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
HBR Guide to Generative AI for Managers
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Web Application Hacker's Handbook: Discovering and Exploiting Security Flaws
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How Linux Works: What Every Superuser Should Know
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
C Programming Language
Brian W. Kernighan, Brian Kernighan, Dennis Ritchie
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Proofs from THE BOOK
Martin Aigner, Günter M. Ziegler
-30% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
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 Waterloö 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.
Vairāk informācijas
| Autors | Stasys Jukna |
|---|---|
| Izdevējs | Springer Berlin Heidelberg |
| Series | Algorithms and Combinatorics |
| Izlaides gads | 2012 |
| Vāka tips | Cietais vāks |
| EAN | 9783642245077 |