I’ve found (and proved) an algorithm that is NP-complete in the assumption that P=NP. In other words, if P=NP has a positive solution, my algorithm is its solution. I was kinda afraid if I already have almost solved P=NP as an easy…

read more
Skip to content
#
Math Research of Victor Porton

Several math research monographies

I’ve found (and proved) an algorithm that is NP-complete in the assumption that P=NP. In other words, if P=NP has a positive solution, my algorithm is its solution. I was kinda afraid if I already have almost solved P=NP as an easy…

read more