Separating NP-completeness notions under strong hypotheses
From MaRDI portal
Recommendations
Cited in
(20)- On strong NP-completeness of rational problems
- Autoreducibility of NP-complete sets under strong hypotheses
- Bi-immunity separates strong NP-completeness notions
- Hard sets are hard to find
- Query-monotonic Turing reductions
- Partial bi-immunity, scaled dimension, and NP-completeness
- NP-completeness notions under strong hypotheses
- Separation of NP-completeness notions
- A thirty year old conjecture about promise problems
- scientific article; zbMATH DE number 176522 (Why is no real title available?)
- scientific article; zbMATH DE number 2086403 (Why is no real title available?)
- scientific article; zbMATH DE number 7599997 (Why is no real title available?)
- scientific article; zbMATH DE number 2201364 (Why is no real title available?)
- The size of SPP
- Strong co-nondeterministic lower bounds for NP cannot be proved feasibly
- Cook versus Karp-Levin: Separating completeness notions if NP is not small
- If not empty, NP-P is topologically large
- Collapsing and separating completeness notions under average-case and worst-case hypotheses
- Inseparability and strong hypotheses for disjoint NP pairs
- Comparing reductions to NP-complete sets
This page was built for publication: Separating NP-completeness notions under strong hypotheses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929911)