Most recent articles

P=NP
29 June 2011, by JulienWe assume that P=NP, and we operate a reduction of the complexity to the problem, wich means that we are going, through a graph, to bring down Nondetermism into Determinism. This path is called couélian — but by removing the A branch, we reach a NPComplete problem, finding an hamiltonian cycle. We conclude therefore that the couélian path (...)
Latest comments