On the relative power of reduction notions in arithmetic circuit complexity (Q1679901): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.ipl.2017.09.009 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2521537240 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1609.05942 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Dichotomy Theorem for Polynomial Evaluation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completeness and reduction in algebraic complexity theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Homomorphism Polynomials Complete for VP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Dichotomy Theorem for Homomorphism Polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity theory companion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algebraic Complexity Classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some complete and intermediate polynomials in algebraic complexity theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Separation of NP-Completeness Notions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Negation can be exponentially powerful / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3929052 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.IPL.2017.09.009 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:57, 11 December 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