Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with complexity-classes
Search options not deleted
user 25879
Questions about relationships between complexity classes.
8
votes
3
answers
239
views
Is $NP$ "minimal", i.e. does $\Pi\notin NP$ imply $\Pi$ is $NP$-hard?
Suppose $\Pi$ is a decidable decision problem.
Does $\Pi\not \in NP$ imply $\Pi$ is $NP$-Hard?
Edit: if we assume there exists $\Pi\in coNP\setminus NP$ then we are done. Can we refute the claim …
- 81