Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
gptkb:Boolean_circuits
CNF formulas DNF formulas |
| gptkbp:author |
gptkb:Johan_Håstad
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Håstad's switching lemma
|
| gptkbp:namedAfter |
gptkb:Johan_Håstad
|
| gptkbp:publishedIn |
1986
|
| gptkbp:relatedTo |
AC0 circuits
parity function random restrictions |
| gptkbp:result |
random restrictions simplify DNF/CNF formulas
|
| gptkbp:shows |
shallow circuits cannot compute parity
|
| gptkbp:usedIn |
circuit lower bounds
proofs of AC0 lower bounds |
| gptkbp:bfsParent |
gptkb:Johan_Håstad
|
| gptkbp:bfsLayer |
6
|