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
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
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 Search options user 137

Questions related to the (computational) complexity of solving problems

13
votes
If A reduces to B, does B reduce to A? No. For a really contrived example, any possible computable problem A is reducible to the Halting Problem: just pass as input the algorithm that solves the …
answered Apr 28 '12 by hugomg
3
votes
Seems this question has been bumped by the system because it has no answer yet: The idea JeffE proposed is to reduce the Hamiltonian Path problem (a known NP-complete problem) to this version of the …
answered May 18 '12 by hugomg
28
votes
1answer
There is an easy polynomial algorithm to decide whether there is a path between two nodes in a directed graph (just do a routine graph traversal with, say, depth-first-search). However it seems that, …
asked Mar 15 '12 by hugomg
8
votes
Informally, the main difference between nondeterministic algorithms and the normal, deterministic, algorithms is that when provided with multiple choices to take, the deterministic solution will have …
answered Apr 13 '12 by hugomg