Hacker News new | past | comments | ask | show | jobs | submit login

Graph isomorphism is one of the two big problems which are not known to be in P and also not known to be NP-complete. (Integer factorization is the other.)



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

Search: