np-hard problems

1 episode mention this concept

Related concepts — line thickness indicates connection strength. Click any node to explore.

Related concepts

Concepts that appear alongside np-hard problems across episodes.

• ibm 650 computer
• geek thinking
• combinatorial explosion
• the art of computer programming (taocp)
• sorting and searching algorithms
• asymptotic notation (big o notation)
• non-uniformity in algorithms
• tex typesetting system
• computational complexity
• literate programming
• compiler design
• levels of abstraction
• floating-point arithmetic
• graph theory
• fundamental algorithms
• turing machines
• computability theory
• semi-numerical algorithms
• formal vs. informal exposition
• machine learning / neural networks (data-driven algorithms)