Tianyan Deng

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
k-CNF is the class of CNF formulas in which the length of each clause of every formula is k. The decision problem asks for an assignment of truth values to the variables that satisfies all the clauses of a given CNF formula. k-SAT problem is k-CNF's decision problem. Cook has shown that k-SAT is NP-complete for k ges 3. (k,s)-CNF is the class of CNF(More)
  • 1