Also known as Cook's theorem
theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
via Wikidata · CC0
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).