Strong and weak reducibility of algorithmic problems1 (Q2799750): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The upper semi-lattice of degrees of recursive unsolvability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Zur Deutung der intuitionistischen Logik / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3232283 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3233/com-150042 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1422201042 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:54, 30 July 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
