Assertion: boolean satisfiability problem | /r/HasProperty | complete
Facets:
Source sentences:
text: For example, the Boolean satisfiability problem is complete for the class NP of decision problems under polynomial-time reducibility.