This is a heavily interactive web application, and JavaScript is required. Simple HTML interfaces are possible, but that is not what this is.
Post
Samuel Vaiter
samuelvaiter.com
did:plc:v2ex7xmwc44boycfxs5bicdg
Graph isomorphism problem asks the following question: given two finite graphs, are they isomorphic? There is no definite answer if it is in P, NP-complete or in another class (for the moment, it defines its proper complexity class GI). arxiv.org/pdf/1701.04372 (in french)
2024-11-14T06:13:35.783Z