Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

Subset sum problem

The subset sum problem (SSP) is a decision problem in computer science. In its most general formulation, there is a multiset S {\displaystyle S} of integers and a target-sum T {\displaystyle T} , and the question is to decide whether any subset of the integers sum to precisely T {\displaystyle T} . The problem is known to be NP-complete. Moreover, some…

Science, Exponential time algorithms & Computational hardness

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Subset sum problem. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Exponential time algorithms

10 related topics

Computational hardness

9 related topics

Pseudo-polynomial time dynamic programming solutions

5 related topics

Polynomial time approximation algorithms

2 related topics

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Computational hardness

Exponential time algorithms

Pseudo-polynomial time dynamic programming solutions

Polynomial time approximation algorithms

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Subset sum problem

Nodes40
Edges39
Triples49
Avg. degree1.95
Density0.05
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Subset sum problem

Top relations

related to Further reading · 41
Subset sum problem → A3, ACM, Algorithms, Charles, Clifford, Computers, Cormen, David, Freeman, Garey, Guide, Intractability, Introduction, ISBN, ISSN, Johnson, Journal, Knapsack, Lagarias, Leiserson
see also · 8
Subset sum problem → Form, Hellman, Knapsack, Mathematical, Multiple, Problem, SSP, The

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

displaystyle sum subset algorithm problem ssp time integers number positive input two given inputs instance elements sums exactly variant also

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
Subset sum problemrelated to Further readingCormen0.60section
Subset sum problemrelated to Further readingThomas0.60section
Subset sum problemrelated to Further readingLeiserson0.60section
Subset sum problemrelated to Further readingCharles0.60section
Subset sum problemrelated to Further readingRivest0.60section
Subset sum problemrelated to Further readingRonald0.60section
Subset sum problemrelated to Further readingStein0.60section
Subset sum problemrelated to Further readingClifford0.60section
Subset sum problemrelated to Further readingThe0.60section
Subset sum problemrelated to Further readingIntroduction0.60section
Subset sum problemrelated to Further readingAlgorithms0.60section
Subset sum problemrelated to Further readingMIT Press0.60section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.