Boolean Function Complexity: Advances and Frontiers - Stasys Jukna
-20% with code BOOKS
Shipping in 12-18 days
30-day return policy
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 ... Full description
You May Also Like
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-20% with code BOOKS
In stock at our supplier
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-20% with code BOOKS
In stock at our supplier
TOP
AI Engineering: Building Applications with Foundation Models
-20% with code BOOKS
In stock at our supplier
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-20% with code BOOKS
In stock at our supplier
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-20% with code BOOKS
In stock at our supplier
TOP
How Linux Works: What Every Superuser Should Know
-20% with code BOOKS
In stock at our supplier
TOP
How To Think About AI: A Guide For The Perplexed
-20% with code BOOKS
In stock at our supplier
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-20% with code BOOKS
In stock at our supplier
TOP
The Art of Game Design: A Book of Lenses
-20% with code BOOKS
In stock at our supplier
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-20% with code BOOKS
In stock at our supplier
TOP
CompTIA Security+ Certification Kit: Exam SY0-701
-20% with code BOOKS
In stock at our supplier
TOP
Automate the Boring Stuff with Python
-20% with code BOOKS
In stock at our supplier
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-20% with code BOOKS
In stock at our supplier
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-20% with code BOOKS
In stock at our supplier
TOP
Heavy Wizardry 101: Shellcodes, Backdoors, Droppers, and Worms
-20% with code BOOKS
In stock at our supplier
TOP
Hacking: The Art of Exploitation
-20% with code BOOKS
In stock at our supplier
TOP
HBR Guide to Generative AI for Managers
-20% with code BOOKS
In stock at our supplier
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-20% with code BOOKS
In stock at our supplier
TOP
Deep Learning
Ian Goodfellow, Yoshua Bengio, Aaron Courville
-20% with code BOOKS
In stock at our supplier
TOP
Computer Systems: A Programmer's Perspective, Global Edition
David R. O'Hallaron, Randal E. Bryant
-20% with code BOOKS
In stock at our supplier
Description
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.
More Information
| Author | Stasys Jukna |
|---|---|
| Publisher | Springer Berlin Heidelberg |
| Series | Algorithms and Combinatorics |
| Release year | 2014 |
| Cover type | Softcover |
| EAN | 9783642431449 |