In this paper, we propose a solution to an NP-complete problem, namely the "3-colorability problem", based on networks of polarized evolutionary processors. Our solution is uniform (it works for all instances of the same size) and time efficient (it works in linear time).
展开▼
