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 np
Search options not deleted
user 113788
Questions about decision problems that can be solved on nondeterministic Turing machines in time polynomial in the length of the input.
1
vote
1
answer
63
views
The meaning of Tautology and Contradiction in Complexity theory
I recently had this question answered on stack exchange:
if X is in NP but Y is not in NP then can X be reduced to Y? … $ that could be reduced to any other problem, including those not in $NP$, thereby giving a direct counter example to the statement: $X \in NP \land Y \not\in NP \implies X \not\le^m_p Y$
What interests …
- 29
0
votes
1
answer
105
views
if X is in NP but Y is not in NP then can X be reduced to Y?
Since X is in NP there must exist some NP-complete problem Z that it reduces to and my thinking is that any other problem that X reduces to must also reduce to this NP-complete problem Z, that is, since … X is in NP both it and any problem it can be reduced to must also reduce to an NP-complete problem Z so it cannot be the case that X can be reduced to a problem Y that is NOT in NP. …
- 29