A natural encoding scheme proved probabilistic polynomial complete (Q593778): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of minimum inference of regular sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4133135 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3214803 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Structure of Polynomial Time Reducibility / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4070738 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(83)90004-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073340866 / rank | |||
Normal rank | |||
Latest revision as of 10:00, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A natural encoding scheme proved probabilistic polynomial complete |
scientific article |
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
