Ask your own question, for FREE!
Computer Science 23 Online
OpenStudy (anonymous):

Where can I find a list of NP-complete problems (with formal statements) where moderately, but not extremely difficult reductions from 3SAT (or other classic NP-complete problems) are possible?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!