Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
sltkr
on April 17, 2024
|
parent
|
context
|
favorite
| on:
Solving the minimum cut problem for undirected gra...
The problem with Karger's algorithm isn't that it's randomized, but that even the expected runtime is orders of magnitude worse than this new deterministic algorithm.
For that reason I wouldn't call it
amazing
though it is an interesting algorithm.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
For that reason I wouldn't call it amazing though it is an interesting algorithm.