Back

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.[1]

  1. ^ Cite error: The named reference moqo was invoked but never defined (see the help page).

Rich TVX News Network Site

Rich TVX News Network Info

© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search