Separating Circuits : Switching Lemmas and Random Restrictions

TL;DR

This paper explores the role of switching lemmas and random restrictions in circuit complexity, highlighting their importance in analyzing Boolean circuits and their implications for complexity class separations.

Contribution

It reviews key results involving switching lemmas and random restrictions, emphasizing their significance in understanding circuit complexity and lower bounds.

Findings

Hastad's Switching Lemma is central to circuit analysis.

Random restrictions simplify Boolean circuits effectively.

Results connect circuit complexity to fundamental complexity class questions.

Abstract

This was submitted as a final project for CS254B, taught by Li Yang Tan and Tom Knowles. The field of Circuit Complexity utilises careful analysis of Boolean Circuit Functions in order to extract meaningful information about a range of complexity classes. In particular, the complexity class $P / \text{Poly}$ has played a central role in much of the historical attempts to tackle the problem of whether solution and verification are equivalent i.e. the central $P$ versus $NP$ problem. Whilst circuits can potentially be easier to analyse than Turing Machines due to their non-uniform nature of computation (program size is allowed to depend on the input size), it is notoriously hard to establish lower bounds for them. In this report, we will touch upon several results published by Hastad, Sipser and Razborov that will highlight a dynamic interplay between circuit complexity and many of the central ideas of modern-day complexity theory, and in particular the central importance of Hastad's Switching Lemma.