On the reducibility of sets inside NP to sets with low information content (Q1765294)
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 reducibility of sets inside NP to sets with low information content |
scientific article; zbMATH DE number 2137319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the reducibility of sets inside NP to sets with low information content |
scientific article; zbMATH DE number 2137319 |
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
0.91649866
0 references
0.88704807
0 references
0.87162834
0 references
0.86475897
0 references
0.86475897
0 references
0.86310595
0 references
0.8596009
0 references
