Not-all-equal 3-satisfiability
id:
not-all-equal-3-satisfiability-289-7801523
title:
Not-all-equal 3-satisfiability
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Not-all-equal_3-satisfiability
date created:
date modified:
2023-10-11T19:16:20Z
main entity:
{"identifier":"Q48998957","url":"https://www.wikidata.org/entity/Q48998957"}
image:
fields total:
13
integrity:
13