1 paper · 1 filter
Angelo Raffaele Meo
The analysis discussed in this paper is based on a well-known NP-complete problem which is called satisfiability problem or SAT. From SAT a new NP-complete problem is derived, whic…