Pages that link to "Item:Q879596"
From MaRDI portal
The following pages link to Comparing reductions to NP-complete sets (Q879596):
Displaying 13 items.
- 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)
- Strong nondeterministic Turing reduction - a technique for proving intractability (Q1262762) (← links)
- \(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness (Q1387830) (← links)
- Autoreducibility of NP-complete sets under strong hypotheses (Q1745961) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- A note on VNP-completeness and border complexity (Q2122788) (← links)
- Nonuniform reductions and NP-completeness (Q2158296) (← links)
- Reductions between disjoint NP-pairs (Q2387199) (← links)
- Automatic Evaluation of Reductions between NP-Complete Problems (Q3192087) (← links)
- Nonuniform reductions and NP-completeness (Q3304139) (← links)
- Strong Reductions and Isomorphism of Complete Sets (Q5458832) (← links)
- Separating NP-completeness notions under strong hypotheses (Q5929911) (← links)