Thinking·OS

Graph explorer

Explore the knowledge graph

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.Approximation algorithm applies to NP-completeness. Activate to inspect this relation.PCP theorem applies to NP-completeness. 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.NP-completeness requires Polynomial-Time Reduction. Activate to inspect this relation.Polynomial-Time Reduction is a Reduction (complexity). 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.Space Complexity explains PSPACE. Activate to inspect this relation.Complexity Class NP is part of PSPACE. 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.Complexity Class NPNondeterminismPSPACEClass PNP-completenessP versus NPSpace ComplexityComputational complexity theoryTime ComplexityPolynomial-Time ReductionComputational ComplexityReduction (complexity)Approximation algorithmPCP theorem
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 concepts17 relationships5 disciplines4 relation families

Complexity Class NP

Open concept →

At a glance

NP is the class of decision problems whose yes-instances have proofs verifiable in polynomial time.

Disciplines
Computational Complexity
Role in the graph
Cross-disciplinary bridge — reaches Computer Science, Mathematics, Theory of Computation
Relationships
5 · 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 5 disciplines: Algorithms, Computational Complexity, Computer Science, Mathematics, Theory of Computation.
  • Class P is a bridge concept — viewed here through Computational Complexity, Computer Science.
  • The connections here span 4 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

ChemistryBiologyPhysicsMathematicsComputer ScienceGeologyMineralogyEconomics

By thinking pattern

Bayesian updatingCause and effectCompoundingConservationConstraintsDefense in depthDiffusion & spreadEmergenceEnergy transformationEntropy & irreversibilityEquilibriumFeedback loopIncentivesInformationLevels & hierarchyModularityNetworksOptimizationOscillationProbabilityRecursion & self-similarityScaleSignal vs noiseSource–pathway–receptorStocks and flowsSymmetry & invarianceThresholds & tipping pointsTrade-offsTriangulationVariation & selectionWaves

By journey

From a Leaf to the ClimateWhy Music Moves UsHow Machines LearnReasoning about a Leaf and the Climate

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.