On the reducibility of sets inside NP to sets with low information content (Q1765294): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcss.2004.03.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2004.03.003 / rank | |||
Normal rank | |||
Latest revision as of 09:38, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the reducibility of sets inside NP to sets with low information content |
scientific article |
Statements
On the reducibility of sets inside NP to sets with low information content (English)
0 references
23 February 2005
0 references
Computational complexity
0 references
Selectivity
0 references
Membership comparability
0 references
Self-reduction
0 references
Sets with low information content
0 references
Prover-verifier protocols
0 references
0 references
0 references
