On the relative power of reduction notions in arithmetic circuit complexity (Q1679901): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:14, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the relative power of reduction notions in arithmetic circuit complexity |
scientific article |
Statements
On the relative power of reduction notions in arithmetic circuit complexity (English)
0 references
22 November 2017
0 references
arithmetic circuits
0 references
reductions
0 references
p-projection
0 references
c-reduction
0 references
Hamiltonian cycle polynomial
0 references
theory of computation
0 references
computational complexity
0 references
