1. Knowra
  2. NP-completeness
  3. Linked from

Linked from

The 22 pages that link to NP-completeness, each with the reason it gives.

All 22Broader topic 3Related 10Narrower topic 7Compared with 2

  • Graph isomorphismCompared with: Graph isomorphism is not known to be NP-complete, unlike many familiar hard problems.

  • Fixed-parameter tractabilityCompared with: Classical NP-hardness alone does not determine whether a problem is fixed-parameter tractable for a chosen parameter.

Machine generatedConnect to another ideaRandom page