Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
kevinventullo
on May 24, 2019
|
parent
|
context
|
favorite
| on:
Algorithm Solves Graph Isomorphism in Record Time ...
I think it's just that many natural algorithms happen to have polynomial time complexity, since it's basically the complexity of iterated loops. Same with logarithms.
Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: