https://www.preprints.org/manuscript/201611.0033
Construct Linear Polynomial Complementary Transformation for NP-Completeness Using Parallel Genetic...
This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial...
linear polynomialnp completenessconstructcomplementarytransformation
https://deepai.org/publication/on-strong-np-completeness-of-rational-problems
On Strong NP-Completeness of Rational Problems | DeepAI
Feb 26, 2018 - 02/26/18 - The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems ...
strong np completenessrationalproblemsdeepai
https://archive.org/details/computersintract0000gare
Computers and intractability : a guide to the theory of NP-completeness : Garey, Michael R : Free...
x, 338 p. : 24 cm. --