Complete problems and strong polynomial reducibilities (Q5096158): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:08, 8 February 2024
scientific article; zbMATH DE number 7571931
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complete problems and strong polynomial reducibilities |
scientific article; zbMATH DE number 7571931 |
Statements
Complete problems and strong polynomial reducibilities (English)
0 references
16 August 2022
0 references
polynomial time
0 references
Turing machine
0 references
complexity class
0 references
recursion theorem
0 references
