Pages that link to "Item:Q5096158"
From MaRDI portal
The following pages link to Complete problems and strong polynomial reducibilities (Q5096158):
Displaying 6 items.
- Strong polynomial-time reducibility (Q676314) (← links)
- A solution to Curry and Hindley's problem on combinatory strong reduction (Q1014284) (← links)
- Exponential-time and subexponential-time sets (Q1261474) (← links)
- DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization (Q1362330) (← links)
- Completeness and reduction in algebraic complexity theory (Q1567446) (← links)
- Barendregt's problem \#26 and combinatory strong reduction (Q2104281) (← links)