Keywords

#not-all-equal_3-satisfiability

Not-all-equal 3-satisfiability

In computational complexity, not-all-equal 3-satisfiability (NAE3SAT) is an NP-complete variant of the Boolean satisfiability problem, often used in proofs of NP-completeness.

Wed 11th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Not-all-equal 3-satisfiability Boolean satisfiability problem 2-satisfiability Cook–Levin theorem Interval scheduling Exponential time hypothesis NL (complexity) Local consistency ♯P-complete Median graph
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.