p=np problem

1 episode mention this concept

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

Related concepts

Concepts that appear alongside p=np problem across episodes.

• obstruction set
• algorithm discoverability
• hamiltonian path
• combinatorial explosion
• polynomial time algorithm
• computational complexity
• graph minors
• planar graphs
• non-constructive proof
• classes of graphs
• np-completeness
• perfect information game
• finite number of obstructions
• graph theory
• algorithm existence