Strong and weak reducibility of algorithmic problems (Q2799750)
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: Strong and weak reducibility of algorithmic problems |
scientific article; zbMATH DE number 6568534
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong and weak reducibility of algorithmic problems |
scientific article; zbMATH DE number 6568534 |
Statements
13 April 2016
0 references
M-problems
0 references
ex-problems
0 references
weak reducibility
0 references
weak degrees
0 references
Strong and weak reducibility of algorithmic problems (English)
0 references