Pages that link to "Item:Q751812"
From MaRDI portal
The following pages link to Cook reducibility is faster than Karp reducibility in NP (Q751812):
Displayed 4 items.
- Cook versus Karp-Levin: Separating completeness notions if NP is not small (Q671427) (← links)
- Reductions among polynomial isomorphism types (Q1077412) (← links)
- Bi-immunity separates strong NP-completeness notions (Q1887166) (← links)
- Partial bi-immunity, scaled dimension, and NP-completeness (Q2480744) (← links)