KnowraLeonid LevinLinked fromLinked fromThe 7 pages that link to Leonid Levin, each with the reason it gives.All 7Related 7Computational complexity theoryRelated: His independent work established the hardness framework alongside Cook's.Boolean satisfiability problemRelated: Levin independently proved a result equivalent to SAT's NP-completeness.Kolmogorov complexityRelated: His independent contributions helped establish the theory of algorithmic randomness and universal search.Cook–Levin theoremRelated: He independently established a related universality result for search problems.Stephen CookRelated: Levin independently proved a closely related completeness theorem in 1973.Algorithmic information theoryRelated: His work helped establish the algorithmic foundations of universal probability and complexity.Richard M. KarpRelated: Levin’s parallel work established the same foundational framework in a separate research tradition.