Bitmask DP uses a bitmask to represent a subset (e.g., which nodes are visited). A common form is dp[mask][i] = best result for subset `mask` ending at `i` (used in problems like TSP). Typical complexity is exponential, often O(n^2 * 2^n) time and O(n * 2^n) memory.