Also known as P versus NP, P=NP, P is not NP, P = NP, P != NP, P ?= NP, P≟NP, P ≟ NP
unsolved problem in computer science about time complexity
~38 min read
Unsolved problem in computer science
If the solution to a problem can be checked in polynomial time, must the problem be solvable in polynomial time?
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).