Complete problems and strong polynomial reducibilities (Q5096158): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3747726 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3862379 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On one-way functions and polynomial-time isomorphisms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5573961 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On one-one polynomial time equivalence relations / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bfb0028988 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1496899201 / rank | |||
Normal rank | |||
Latest revision as of 10:10, 30 July 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
