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.
Related concepts
Concepts that appear alongside polynomial time algorithm across episodes.
- graph theory
- np-completeness
- computational complexity
- hamiltonian path
- formal proofs
- combinatorial explosion
- turing test
- hungarian algorithm
- graph minors
- planar graphs
- p=np problem
- non-constructive proof
- classes of graphs
- moore's law
- network flow problem
- assignment problem
- perfect information game
- finite number of obstructions
- algorithm existence
- traveling salesman problem (tsp)