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 questions only
not deleted
user 20154
Questions about decision problems that can be solved on nondeterministic Turing machines in time polynomial in the length of the input.
10
votes
1
answer
608
views
Are NP-complete sets formed from two other sets only if at least one is NP-hard?
I also
know that the conditions of "decidable" and "NP-hard" are necessary
since if we consider any NP-complete set $L$ and another set $B$ outside
of NP (whether just NP-hard or undecidable) then we can … form two
new NP-hard sets not in NP whose intersection is NP-complete. …
- 1,641
14
votes
1
answer
3k
views
Is determining if there is a prime in an interval known to be in P or NP-complete?
I saw from this post on stackoverflow that there are some relatively fast algorithms for sieving an interval of numbers to see if there is a prime in that interval. However, does this mean that the …
- 1,641