0 users think it is non-scientific; after 15 it will be moderated.

Victor Porton

A new proof that if P=NP, it’s a constructive problem (that is an algorithm that is polynomial-time NP-complete under the supposition that polynomial-time NP-complete algorithms exist).

This is my first significant CS theorem. My previous results were in general topology and something related with logic.

0 users think it is non-scientific; after 15 it will be moderated.