Warning: Before you leave note that This is not my original account, I am not newbie, I am GM irl
I think I solved maximal independent set problem which was called NP hard problem. My Solution works in O(log(n)*n*sqrt(n))) Time and alot of memory.I think I have created some of the new techniques, during solving the problem. Solution is quite big, and it may not be clear, because there is only a code. If you test it, you can see it's correct. I will share my solution in editorial style,after wise peaple test it and confirm that it's true. Otherwise I will fix it. I will never gonna give you up.
