combinatorial algorithms
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- lexfridmanDec 30, 2019
Donald Knuth: The Art of Computer Programming, Geek Thinking, and the Evolution of Algorithms
TechnologyComputational complexityAsymptotic notation (Big O notation)TeX typesetting systemIBM 650 computer
Knowledge Graph
Related concepts — line thickness indicates connection strength. Click any node to explore.
Related concepts
Concepts that appear alongside combinatorial algorithms across episodes.
- computational complexity
- graph theory
- p versus np problem
- formal proofs
- combinatorial explosion
- the art of computer programming (taocp)
- sorting and searching algorithms
- asymptotic notation (big o notation)
- non-uniformity in algorithms
- polynomial time algorithm
- tex typesetting system
- turing test
- hungarian algorithm
- np-hard problems
- literate programming
- compiler design
- levels of abstraction
- moore's law
- network flow problem
- np-completeness