On the reducibility of sets inside NP to sets with low information content (Q1765294): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:19, 1 February 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
