Login / Signup
Linearly-growing Reductions of Karp's 21 NP-complete Problems.
Jerzy A. Filar
Michael Haythorpe
Richard Taylor
Published in:
CoRR (2019)
Keyphrases
</>
np complete problems
np complete
graph coloring
phase transition
hard problems
sat problem
computational complexity
satisfiability problem
combinatorial problems
scheduling problem
constraint satisfaction problems
job shop scheduling