Pages that link to "Item:Q2763492"
From MaRDI portal
The following pages link to NP-completeness notions under strong hypotheses (Q2763492):
Displaying 10 items.
- Comparing reductions to NP-complete sets (Q879596) (← links)
- On strong NP-completeness of rational problems (Q1625182) (← links)
- Separation of NP-completeness notions (Q2784487) (← links)
- Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis (Q2978535) (← links)
- (Q4779131) (← links)
- (Q5039187) (← links)
- (Q5313792) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465865) (← links)
- Separating NP-completeness notions under strong hypotheses (Q5929911) (← links)
- Strong co-nondeterministic lower bounds for NP cannot be proved feasibly (Q6086996) (← links)