News for hackers. Stuff that matters.
Re:Algorithm Solves Graph Isomorphism in Record Time (2015) by ivanbakel on Friday May 24, 2019 @04:39PM (#20005079)
Because polynomial complexity is the measure of what makes a tractable problem [1]. If the question is why - there's no formal reason. Tractability is really just subjective human standards: even high-degree polynomial time is often considered to not enough for a solution to be worthwhile computing.

[1][https://en.wikipedia.org/wiki/Cobham%27s_thesis]

Re:Algorithm Solves Graph Isomorphism in Record Time (2015) by mehrdadn on Friday May 24, 2019 @04:47PM (#20005144)
Yes, my question was indeed why. At the very least, I would hope for explicit mentions that this is an arbitrary choice when the subject is being taught, and mentions of algorithms with running times between polynomials and exponentials. Otherwise it gives people the wrong impression that there isn't anything in between worth considering, which is misleading and just wrong.