<p>For <a href="https://en.wikipedia.org/wiki/Optimal_job_scheduling" rel="noreferrer">job scheduling problems</a>, there is this <a href="http://schedulingzoo.lip6.fr/" rel="noreferrer">complexity wiki</a>. I am not sure if it is actively being updated.</p>

CC BY-SA 4.0
2023-06-28T06:08:17.957Z
2023-06-28T06:08:17.957Z
Inuyasha Yagami
<p>For fixed-parameter tractability, there is this wiki: <a href="http://fpt.wikidot.com/fpt-races/" rel="nofollow noreferrer">http://fpt.wikidot.com/fpt-races/</a> (seems to be updated only until ~10 years ago.)
The problem with most such resources is that it takes a lot of effort to curate them and keep them up to date.</p>

CC BY-SA 4.0
2023-07-07T14:24:09.480Z
2023-07-07T14:24:09.480Z
Hermann Gruber
<p>Most classical computer science problems are still open concerning the exact asymptotic algorithmic worst-case complexity required to solve them.</p>
<p>Is there any online collaborative wiki (or other references, e.g. periodicals) specialized in aggregating the best upper (the best algorithm known so far) and lower bounds known for the worst-case complexity of computer science problems?</p>

<cc.complexity-theory><reference-request><time-complexity>
General collection with the current state of complexity bounds of well-known unsolved problems?
FxMySz
# General collection with the current state of complexity bounds of well-known unsolved problems?

(Asked by: username_0 on 2023-06-27)

Most classical computer science problems are still open concerning the exact asymptotic algorithmic worst-case complexity required to solve them.

Is there any online collaborative wiki (or other references, e.g. periodicals) specialized in aggregating the best upper (the best algorithm known so far) and lower bounds known for the worst-case complexity of computer science problems?

**Tags:** cc.complexity-theory, reference-request, time-complexity

---

## 2 answers

### Answer by username_1 on 2023-06-28. Score: 8

For [job scheduling problems](https://en.wikipedia.org/wiki/Optimal_job_scheduling), there is this [complexity wiki](http://schedulingzoo.lip6.fr/). I am not sure if it is actively being updated.


---

### Answer by username_2 on 2023-07-07. Score: 4

For fixed-parameter tractability, there is this wiki: <http://fpt.wikidot.com/fpt-races/> (seems to be updated only until ~10 years ago.)
The problem with most such resources is that it takes a lot of effort to curate them and keep them up to date.


---

