Disambiguation evidence for Cook–Levin theorem via surface form

"SAT is NP-complete"

Triples (2)

Triples where some other subject referred to this entity as "SAT is NP-complete".

The Complexity of Theorem-Proving Procedures → result →
"SAT is NP-complete"
↳ resolves to Cook–Levin theorem
ⓘ
linked to: "The Complexity of Theorem-Proving Procedures"
Cook–Levin theorem → establishes →
"SAT is NP-complete"
↳ resolves to Cook–Levin theorem
ⓘ