Now showing items 1-1 of 1
Solving SAT with Antimatter in Membrane Computing [Presentation]
(Fénix Editora, 2015)
The set of NP-complete problems is split into weakly and strongly NP- complete ones. The di erence consists in the in uence of the encoding scheme of the input. In the case of weakly NP-complete problems, the intractability ...