- #1
secondprime
- 49
- 0
I am trying to construct an algorithm which is combinatorial in nature. I have shared a link-
https://www.academia.edu/11354697/Graph_regular_Isomorphism_in_n_O_log2_n_
which depicts the idea simply using an example. I claim (if it is correct) n^(O(log2(n))) time complexity.
happy to have comments!
https://www.academia.edu/11354697/Graph_regular_Isomorphism_in_n_O_log2_n_
which depicts the idea simply using an example. I claim (if it is correct) n^(O(log2(n))) time complexity.
happy to have comments!
Last edited by a moderator: