Graph explorer

Explore the knowledge graph

Optimization requires Trade-off. Activate to inspect this relation.Optimization applies to Efficiency. Activate to inspect this relation.Machine learning is a Algorithm. Activate to inspect this relation.Machine learning depends on Optimization. Activate to inspect this relation.Analysis of algorithms is a Computational complexity theory. Activate to inspect this relation.Computational complexity theory is a Computability theory. Activate to inspect this relation.Computational complexity theory is part of Algorithm. Activate to inspect this relation.NP-complete is part of Computational complexity theory. Activate to inspect this relation.NP-complete applies to Optimization. Activate to inspect this relation.Gradient descent applies to Optimization. Activate to inspect this relation.NP-completeness is part of Computational complexity theory. Activate to inspect this relation.Class P is part of Computational complexity theory. Activate to inspect this relation.BQP (quantum complexity) is part of Computational complexity theory. Activate to inspect this relation.Optimization applies to Mathematical model. Activate to inspect this relation.NP-completeComputational complexity theoryOptimizationComputability theoryAnalysis of algorithmsAlgorithmNP-completenessClass PBQP (quantum complexity)Trade-offMachine learningEfficiencyGradient descentMathematical model
Relationship types
Legend
  • Focused concept
  • Connected concept
  • Arrow points from cause / source to effect / target
  • A line with no arrow is a two-way relationship
  • Node colour marks the concept’s primary discipline
14 concepts14 relationships27 disciplines3 relation families

NP-complete

Open concept →

At a glance

In computational complexity theory, NP-complete problems are the hardest of the problems to which solutions can be verified quickly.

Disciplines
Computer Science · Algorithms
Role in the graph
Cross-disciplinary bridge reaches Business, Economics, Engineering, Mathematical Modelling, Optimization, Systems Engineering
Relationships
2 · 2 relation families

Insights from this view

Structural observations about the concepts shown here — descriptions of this graph, not claims about the world.

  • This view connects 27 disciplines: Algorithms, Artificial Intelligence, Biology, Business, Computational Complexity, Computer Science, Data Science, Design, Discrete Mathematics, Economics, Engineering, Environmental Engineering, Ethics, Logic, Machine Learning, Mathematical Modelling, Mathematics, Optimization, Physics, Political Science, Public Policy, Software Engineering, Statistics, Sustainability Science, Systems Engineering, Systems Science, Theory of Computation.
  • NP-complete is a bridge concept — viewed here through Algorithms, Computer Science.
  • The connections here span 3 relation families.
  • Trade offs explains 3 concepts in this view (Biology, Business, Design, Economics, Engineering, Environmental Engineering, Ethics, Mathematical Modelling, Optimization, Physics, Political Science, Public Policy, Sustainability Science, Systems Engineering).

Relationships as a list

The focused concept’s relationships. Pick another concept in the graph above to update this list.

Explore through a different lens

A lens is a deterministic projection of the graph. Pick a discipline, thinking pattern or journey to reframe the whole view.

By discipline

By thinking pattern

By journey

Concept collections

Concept collections are curated lenses onto the fabric — themed sets of ideas that recur across disciplines. They are not journeys; they are a way to read the graph.

About this view

What this is

Start from one concept and expand outward. The view never shows everything at once — click a node to refocus, filter by relationship type, or switch to an accessible list.

One fabric

3750 concepts and 5051 typed relations form one connected component — no isolated silo.

How to read it

Focus a concept, or apply a lens (discipline, mental model, journey) to see only the threads that matter.