The subset-sum problem is one of the most frequently occurring NP (nondeterministic, polynomial-time)-complete) problems. It asks whether a subset of numbers in a set of positive integers adds up ...
What Is This Subset Sum Solver? This is the world record exact subset sum solver. It holds world records across all 65 tested algorithm categories, solving the NP-complete subset sum problem from 10 ...
An interactive web app that visually walks you through the Subset Construction Algorithm — the technique used to convert a Nondeterministic Finite Automaton (NFA) into a Deterministic Finite Automaton ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results