Groups
Category
Level
NP-completeness classifies decision problems that are both in NP and as hard as any problem in NP via polynomial-time reductions.
P vs NP asks whether every problem whose solutions can be verified quickly can also be solved quickly.
Plug DP (DP on broken profile with plugs) sweeps a grid cell by cell while remembering how partial path segments cross the frontier as labeled “plugs.”
Broken Profile DP is a dynamic programming technique that sweeps a grid one cell or one column at a time while encoding the boundary between processed and unprocessed cells as a compact state.