Pages that link to "Item:Q1158964"
From MaRDI portal
The following pages link to A note on structure and looking back applied to the relative complexity of computable functions (Q1158964):
Displaying 19 items.
- Minimal pairs for P (Q795830) (← links)
- Honest polynomial time reducibilities and the \(P=?NP\) problem (Q909455) (← links)
- The recursion-theoretic structure of complexity classes (Q1064320) (← links)
- Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets (Q1075319) (← links)
- Some remarks on witness functions for nonpolynomial and noncomplete sets in NP (Q1079364) (← links)
- Diagonalizations over polynomial time computable sets (Q1107526) (← links)
- On the relative complexity of hard problems for complexity classes without complete problems (Q1112017) (← links)
- A uniform approach to obtain diagonal sets in complexity classes (Q1164414) (← links)
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory (Q1193873) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- Nondiamond theorems for polynomial time reducibility (Q1201882) (← links)
- Minimal pairs and complete problems (Q1334663) (← links)
- Index sets and presentations of complexity classes (Q1366536) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- Uniformly hard languages. (Q1874273) (← links)
- On computational complexity and honest polynomial degrees (Q2277252) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- Generality's price: Inescapable deficiencies in machine-learned programs (Q2368918) (← links)
- On closure properties of bounded two-sided error complexity classes (Q4835865) (← links)
