It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 11 years ago.
I'm studying computability theory, and I'm looking for a problem that clearly can be solved, but not in polynomial time.
I tried thinking of all sort's of examples, but it wasn't clear why they can't be solved in polynomial time..
The travelling sales man problem.
Related
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 9 years ago.
Has anybody implemented a CUDA parallelization version of Dijkstra's Algorithm for a given sparse matrix (cuSPARSE) graph, and for source, and target node, find the minimal K path?
I really need it to solve a general graph I'll be constructing.
Vincent
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
I'm looking for Einstein's Riddle solution using F# and I've found only Einstein meets F#.
Is F# suitable for this problem and are there any other implementations?
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
In plain English describe the algorithm for an insertion sort of items in an array.
I've also been asked to use diagrams if appropriate but that's a little hard on here I understand.
Here is a PDF presentation which describes insertion sort.
With a quick google search http://en.wikipedia.org/wiki/Insertion_sort
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 12 years ago.
Where can I find source code for travelling salasman problem?
nowhere, it's not been solved.
You had mentioned that you were having problems with more than 8 or 9 nodes. This isn't surprising because the complexity increases exponentially with each added node.
As a result many solutions involve Genetic programming to gradually evolve a good answer. Finding the best generally requires a brute-force check of all possibilities.
One example is here, which also provides their source code.
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 9 years ago.
how can I build a balanced quad tree.
Thanks, Marcos
Balancing is traditionaly a part of "k-D Tree" algorithm, which is superset for octrees. Try e.g. wikipedia page on this algorithm.