Håstad’s switching lemma
E120579
UNEXPLORED
Håstad’s switching lemma is a fundamental result in computational complexity theory that provides powerful bounds on the simplification of Boolean formulas under random restrictions, with major applications in circuit lower bounds.
Referenced by (1)
| Subject (surface form when different) | Predicate |
|---|---|
|
Johan Håstad
→
|
knownFor |