Graph explorer

Explore the knowledge graph

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-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.Reduction (complexity) applies to NP-completeness. Activate to inspect this relation.BQP (quantum complexity) is part of Computational complexity theory. Activate to inspect this relation.Approximation algorithm applies to NP-completeness. Activate to inspect this relation.PCP theorem applies to NP-completeness. Activate to inspect this relation.Class P is part of Complexity Class NP. Activate to inspect this relation.NP-completeness is part of Complexity Class NP. Activate to inspect this relation.NP-completeness requires Polynomial-Time Reduction. Activate to inspect this relation.Polynomial-Time Reduction is a Reduction (complexity). Activate to inspect this relation.NP-completeness is part of Computational Complexity. Activate to inspect this relation.NP-completeness depends on Reduction (complexity). Activate to inspect this relation.Approximation algorithmNP-completenessComputational complexity theoryComplexity Class NPPolynomial-Time ReductionComputational ComplexityReduction (complexity)PCP theoremComputability theoryAnalysis of algorithmsAlgorithmNP-completeClass PBQP (quantum complexity)
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 concepts16 relationships8 disciplines3 relation families

Approximation algorithm

Open concept →

At a glance

An algorithm that efficiently finds provably near-optimal solutions to hard problems it cannot solve exactly.

Disciplines
Computer Science
Role in the graph
Leaf concept
Relationships
1 · 1 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 8 disciplines: Algorithms, Computational Complexity, Computer Science, Discrete Mathematics, Logic, Mathematics, Software Engineering, Theory of Computation.
  • Algorithm is a bridge concept — viewed here through Algorithms, Computer Science, Discrete Mathematics, Logic, Mathematics, Software Engineering, Theory of Computation.
  • The connections here span 3 relation families.

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.