Complete problems and strong polynomial reducibilities (Q5096158): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 22:15, 29 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