2 ms·
This is wrong. For a proof of polynomial time requires steps to construct the actual computable function. This paper does not do that. It simply shows that it
by paulpauper 4y ago
This is wrong. For a proof of polynomial time requires steps to construct the actual computable function. This paper does not do that. It simply shows that it's possible to solve a system of equation in some finite number of steps, but this tells you nothing about construction of the finite polynomial algorithm. All this proves is Gaussian elimination is o(N^3) which is well -established.