Boolean Function Complexity

Más información sobre el libro

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.