Determining-the-satisfiability-of-a-formula-in-whi -- Multiple sentences match

+ −

Determining the satisfiability of a formula in which each clause is limited to at most two literals is NL-complete ; this problem is called " 2SAT ".

Promote Demote Fragment Fix

+ −

Determining the satisfiability of a formula in which each clause is a Horn clause ( i. e. it contains at most one positive literal ) is P-complete ; this problem is called Horn-satisfiability.

Promote Demote Fragment Fix

« More previous Okay Cancel More next »

0.002 seconds.

Most text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply.