On the relative power of reduction notions in arithmetic circuit complexity (Q1679901)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the relative power of reduction notions in arithmetic circuit complexity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7320389747619629
0 references
0.7313631772994995
0 references
