Concepts4

Category

🔷All∑Math⚙️Algo🗂️DS📚Theory

Level

AllBeginnerIntermediateAdvanced
Filtering by:
#hamiltonian path
📚TheoryIntermediate

NP-Completeness

NP-completeness classifies decision problems that are both in NP and as hard as any problem in NP via polynomial-time reductions.

#np-complete#np-hard#polynomial-time reduction+12
📚TheoryAdvanced

P vs NP Problem

P vs NP asks whether every problem whose solutions can be verified quickly can also be solved quickly.

#p vs np#np-complete#np-hard+12
⚙️AlgorithmAdvanced

DP on Broken Profile - Plug DP

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.”

#plug dp#broken profile#hamiltonian path+12
⚙️AlgorithmAdvanced

Broken Profile DP

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.

#broken profile dp#profile dp#plug dp+11