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-theory
Search options not deleted
user 45271
Questions related to the (computational) complexity of solving problems
-2
votes
Why isn't this undecidable problem in NP?
We think that the dilemma you raised about Diophantine equation is very significant, because it reveals something abnormal in the current definition of NP :
- A problem is said to be in NP if and onl …
- 21
-1
votes
Why isn't this undecidable problem in NP?
I try to provide more details for my above answer.
In fact, this question is a dilemma problem.
On one hand, the Diophantine Equation Problem (DEP) is undecidable according to Matiyesevich’s theor …
- 21