« first day    last day (572 days later) » 

Thomas Klimpel
Thomas Klimpel
8:38 AM
So I read the paper now. As expected, the presented approach is not sufficient to get a polynomial time algorithm for graph isomorphism.
The reason is simply that 2-dim Weisfeiler-Leman is "not worse" than this proposed algorithm, and it is well known that 2-dim Weisfeiler-Leman does not lead to a polynomial time algorithm for graph isomorphism.
This doesn't mean that the paper is bad, or was not worth my time to read it.
 

« first day    last day (572 days later) »