Hacker News new | past | comments | ask | show | jobs | submit login
Graph Isomorphism in Quasi-polynomial time (uchicago.edu)
6 points by nicknash on Nov 4, 2015 | hide | past | favorite | 1 comment



This is a really amazing result. Scott Aaronson has a little more background info than just the talk announcement

http://www.scottaaronson.com/blog/?p=2521




Consider applying for YC's Spring batch! Applications are open till Feb 11.

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

Search: