Pages that link to "Item:Q1097692"
From MaRDI portal
The following pages link to A comparison of polynomial time completeness notions (Q1097692):
Displaying 15 items.
- Nontriviality for exponential time w.r.t. weak reducibilities (Q391074) (← links)
- Cook versus Karp-Levin: Separating completeness notions if NP is not small (Q671427) (← links)
- Collapsing and separating completeness notions under average-case and worst-case hypotheses (Q693053) (← links)
- Cook reducibility is faster than Karp reducibility in NP (Q751812) (← links)
- Comparing reductions to NP-complete sets (Q879596) (← links)
- On polynomial-time Turing and many-one completeness in PSPACE (Q1193869) (← links)
- Exponential-time and subexponential-time sets (Q1261474) (← links)
- On 1-truth-table-hard languages (Q1261477) (← links)
- The relative power of logspace and polynomial time reductions (Q1312179) (← links)
- Almost complete sets. (Q1426448) (← links)
- Distinguishing conjunctive and disjunctive reducibilities by sparse sets (Q1823690) (← links)
- Non-uniform reductions (Q1959376) (← links)
- Weak completeness notions for exponential time (Q2322715) (← links)
- Query-monotonic Turing reductions (Q2383592) (← links)
- Partial bi-immunity, scaled dimension, and NP-completeness (Q2480744) (← links)
