Once upon a time, people published solo often. It's just harder to do things lik... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		rescrv 7 months ago \| parent \| context \| favorite \| on: A Homological Proof of P != NP: Computational Topo... Once upon a time, people published solo often. It's just harder to do things like that these days.

gus_massa 7 months ago [–]

In the last few months, I've seen a proof of P=/!=NP every two weeks in /newest, so color me skeptic.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact