Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Tryk
5 months ago
|
parent
|
context
|
favorite
| on:
Solving the minimum cut problem for undirected gra...
Invert all edge weights.
fuglede_
5 months ago
[–]
This would prove P = NP. The catch being that only positive weights are allowed.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
