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.Big O notation is part of Analysis of algorithms. Activate to inspect this relation.Turing machine models Algorithm. Activate to inspect this relation.Computability theory depends on Turing machine. 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.P versus NP applies to Algorithm. Activate to inspect this relation.BQP (quantum complexity) is part of Computational complexity theory. Activate to inspect this relation.Time Complexity measures Turing machine. Activate to inspect this relation.Time Complexity requires Big O notation. Activate to inspect this relation.Class P depends on Time Complexity. Activate to inspect this relation.Complexity Class NP depends on Nondeterminism. 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.P versus NP applies to Class P. Activate to inspect this relation.P versus NP applies to Complexity Class NP. Activate to inspect this relation.Algorithm models Turing machine. Activate to inspect this relation.Class PComputational complexity theoryTime ComplexityComplexity Class NPP versus NPComputability theoryAnalysis of algorithmsAlgorithmNP-completeNP-completenessBQP (quantum complexity)Turing machineBig O notationNondeterminism
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 concepts20 relationships8 disciplines4 relation families

At a glance

P is the class of problems solvable in polynomial time — the practical, efficiently-solvable problems.

Disciplines
Computational Complexity · Computer Science
Role in the graph
Cross-disciplinary bridge reaches Algorithms, Mathematics
Relationships
4 · 3 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.
  • Class P is a bridge concept — viewed here through Computational Complexity, Computer Science.
  • The connections here span 4 relation families.
  • Information explains 2 concepts in this view (Algorithms, Computational Complexity, Computer Science, Discrete Mathematics, Logic, Mathematics, Software Engineering, Theory of Computation).

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.