Strong and weak reducibility of algorithmic problems1 (Q2799750): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:14, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong and weak reducibility of algorithmic problems1 |
scientific article |
Statements
Strong and weak reducibility of algorithmic problems1 (English)
0 references
13 April 2016
0 references
M-problems
0 references
ex-problems
0 references
weak reducibility
0 references
weak degrees
0 references
