Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:canBe |
homogeneous
multilinear non-homogeneous non-multilinear |
| gptkbp:computes |
polynomial functions
|
| gptkbp:consistsOf |
addition gates
input nodes multiplication gates output node |
| gptkbp:hasApplication |
cryptography
symbolic computation complexity lower bounds |
| gptkbp:hasComplexityMeasure |
circuit depth
circuit size |
| gptkbp:hasGate |
addition
multiplication |
| https://www.w3.org/2000/01/rdf-schema#label |
Arithmetic circuits
|
| gptkbp:input |
variables or constants
|
| gptkbp:output |
gptkb:algebra
|
| gptkbp:relatedTo |
gptkb:Boolean_circuits
circuit complexity P vs NP problem (algebraic version) Valiant's hypothesis |
| gptkbp:studiedIn |
theoretical computer science
|
| gptkbp:usedIn |
algebraic complexity theory
|
| gptkbp:bfsParent |
gptkb:Multiplexers
|
| gptkbp:bfsLayer |
7
|