collaborators

1 paper

cs.DS2017

A new algorithm for Solving 3-CNF-SAT problem

Belal Qasemi

NP-Complete problems have an important attribute that if one NP-Complete problem can be solved in polynomial time, all NP-Complete problems will have a polynomial solution. The 3-C…