polynomial time algorithm
2 episodes mention this concept
lexfridmanJul 26, 2020Richard Karp: The Elegance of Algorithms, NP-Completeness, and the Philosophical Limits of AI
SciencePlain geometryFormal proofsComputational complexityP versus NP problem- lexfridmanJan 4, 2020
Donald Knuth on P=NP, Algorithm Existence, and the Robertson-Seymour Theorem
ScienceP=NP problemAlgorithm existenceAlgorithm discoverabilityComputational complexity
Knowledge Graph
Related concepts — line thickness indicates connection strength. Click any node to explore.
Want to explore how this connects to concepts you choose? Try Nexus →