Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
gptkb:Boolean_circuits
|
| gptkbp:describes |
relationship between circuit depth and circuit size for Boolean functions
|
| gptkbp:field |
circuit complexity
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Pippenger's theorem
|
| gptkbp:namedAfter |
gptkb:Nicholas_Pippenger
|
| gptkbp:publicationYear |
1979
|
| gptkbp:publishedIn |
gptkb:Journal_of_Computer_and_System_Sciences
|
| gptkbp:relatedTo |
circuit depth
circuit size parallel computation |
| gptkbp:state |
for any Boolean function computable by a circuit of size S and depth D, there exists a circuit of size O(S) and depth O(D) with bounded fan-in
|
| gptkbp:bfsParent |
gptkb:Nicholas_Pippenger
|
| gptkbp:bfsLayer |
7
|