<p>There's an attempt to build such a resource. It's called the <a href="http://qwiki.stanford.edu/index.php/Complexity_Garden" rel="nofollow noreferrer">Complexity Garden</a> and is "the botanical companion to the Complexity Zoo". Also see <a href="https://cstheory.meta.stackexchange.com/questions/1299/is-there-any-way-to-spread-an-announcement">this meta discussion</a>.</p>

CC BY-SA 3.0
2011-09-06T16:31:15.420Z
2011-09-06T16:31:15.420Z
2017-03-16T15:45:13.547Z
Suresh Venkat
<p>There are many question that pose a none obscure problem and ask for the "best" algorithm, whatever "best" means.</p>

<p>For example, <a href="https://cstheory.stackexchange.com/questions/8093/given-a-graph-decide-if-its-edge-connectivity-is-at-least-n-2-or-not">Given a graph, decide if its edge connectivity is at least n/2 or not</a>, </p>

<p>The normal process is to search the literature with every single name of the problem, and find a recent paper. Usually the "best" result will be the one of the references. A more recent approach is to ask the question here.</p>

<p>Are there websites specifically dedicated with information like this? A database of problems and list of algorithms with their complexities? I am imagining an OEIS for problems instead of integer sequences.</p>

CC BY-SA 3.0
2011-09-06T06:00:06.947Z
See [this question](http://cstheory.stackexchange.com/questions/4784/compendium-of-the-best-approximation-and-hardness-results-for-np-optimization-pro), I think this should be closed as duplicate.
Kaveh
CC BY-SA 3.0
2011-09-06T06:20:56.773Z
I was not aware of that post. The answers do indicate no satisfactory resource exists. This should be closed.
Chao Xu
CC BY-SA 3.0
2011-09-06T06:41:13.637Z
I agree that this question is a duplicate in spirit. However, this question is amore general than the linked one; in title at least. Although [this answer](http://cstheory.stackexchange.com/questions/4784/compendium-of-the-best-approximation-and-hardness-results-for-np-optimization-pro/7974#7974) would answer this more general question, the other answers are specific to NP-hardness results and/or are discussions. Thus it would be a little awkward to close it as "exact duplicate", no?
Artem Kaznatcheev
<soft-question>
Resources to find the "best" algorithm for a problem?
Chao Xu
# Resources to find the "best" algorithm for a problem?

(Asked by: username_0 on 2011-09-06)

There are many question that pose a none obscure problem and ask for the "best" algorithm, whatever "best" means.

For example, [Given a graph, decide if its edge connectivity is at least n/2 or not](https://cstheory.stackexchange.com/questions/8093/given-a-graph-decide-if-its-edge-connectivity-is-at-least-n-2-or-not),

The normal process is to search the literature with every single name of the problem, and find a recent paper. Usually the "best" result will be the one of the references. A more recent approach is to ask the question here.

Are there websites specifically dedicated with information like this? A database of problems and list of algorithms with their complexities? I am imagining an OEIS for problems instead of integer sequences.

**Tags:** soft-question

> **Comments:**
> **username_1**: See [this question](http://cstheory.stackexchange.com/questions/4784/compendium-of-the-best-approximation-and-hardness-results-for-np-optimization-pro), I think this should be closed as duplicate.  
> **username_0**: I was not aware of that post. The answers do indicate no satisfactory resource exists. This should be closed.  
> **username_2**: I agree that this question is a duplicate in spirit. However, this question is amore general than the linked one; in title at least. Although [this answer](http://cstheory.stackexchange.com/questions/4784/compendium-of-the-best-approximation-and-hardness-results-for-np-optimization-pro/7974#7974) would answer this more general question, the other answers are specific to NP-hardness results and/or are discussions. Thus it would be a little awkward to close it as "exact duplicate", no?  

---

## 1 answers

### Answer by username_3 on 2011-09-06. Score: 3 | Accepted answer

There's an attempt to build such a resource. It's called the [Complexity Garden](http://qwiki.stanford.edu/index.php/Complexity_Garden) and is "the botanical companion to the Complexity Zoo". Also see [this meta discussion](https://cstheory.meta.stackexchange.com/questions/1299/is-there-any-way-to-spread-an-announcement).


---

