The graph of multiplication is equivalent to counting (Q1190513): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On uniformity within \(NC^ 1\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constant Depth Reducibility / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3941393 / rank | |||
Normal rank | |||
Latest revision as of 10:46, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The graph of multiplication is equivalent to counting |
scientific article |
Statements
The graph of multiplication is equivalent to counting (English)
0 references
26 September 1992
0 references
constant depth circuits
0 references
threshold circuits
0 references
circuit complexity
0 references
graph of multiplication
0 references
