Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Not-all-equal 3-satisfiability
open-in-new
<p>In <a href="/facts/Computational_complexity/Qenh22Ja">computational complexity</a>, not-all-equal 3-satisfiability (NAE3SAT) is an <a href="/facts/NP-complete/NFPv56DU">NP-complete</a> variant of the <a href="/facts/Boolean_satisfiability_problem/wBVRjWoy">Boolean satisfiability problem</a>, often used in proofs of NP-completeness. </p>