Pages that link to "Item:Q1201882"
From MaRDI portal
The following pages link to Nondiamond theorems for polynomial time reducibility (Q1201882):
Displaying 10 items.
- Strong polynomial-time reducibility (Q676314) (← links)
- Sylow's theorem in polynomial time (Q1063109) (← links)
- Minimal pairs and complete problems (Q1334663) (← links)
- Uniformly hard languages. (Q1874273) (← links)
- Nonuniform reductions and NP-completeness (Q2158296) (← links)
- (Q3730019) (← links)
- (Q3731587) (← links)
- RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS (Q4315092) (← links)
- On Nondeterminism, Enumeration Reducibility and Polynomial Bounds (Q4351919) (← links)
- (Q4733404) (← links)