Content deleted Content added
Samuel Buss' given name/surname mismatched; exact title of Buss' paper; Wikifying |
No edit summary |
||
Line 5:
The problem is closely related to the [[Boolean satisfiability problem|Boolean Satisfiability Problem]] which is complete for [[NP (complexity)|NP]] and its complement [[Tautology (logic)|Propositional Tautologihood Problem]] which is complete for [[co-NP]].
{{compu-prog-stub}}▼
▲== References ==
{{Reflist}}
Line 12 ⟶ 11:
[[Category:Computational problems]]
[[Category:Theoretical computer science]]
▲{{compu-prog-stub}}
| |||