A natural encoding scheme proved probabilistic polynomial complete (Q593778)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3833298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A natural encoding scheme proved probabilistic polynomial complete |
scientific article; zbMATH DE number 3833298 |
Statements
A natural encoding scheme proved probabilistic polynomial complete (English)
0 references
1983
0 references
UR-completeness
0 references
PR-completeness
0 references
probabilistic polynomial complete
0 references
unfaithful random complete
0 references
encoding schemes
0 references
probabilistic Turing machines
0 references
Kolmogorov complexity
0 references
