Fine-Grained Complexity

Core Idea

Fine-grained complexity studies the exact polynomial-time complexity of problems within P or NP, asking not just "is this polynomial-time solvable?" but "what polynomial power is necessary?" The Orthogonal Vectors (OV) problem exemplifies this: given n sets of d-dimensional binary vectors, do any two come from different sets and have inner product 0? An O(n^2 d) algorithm is trivial, but whether it can be improved to O(n^2 - epsilon d^O(1)) is open despite decades of research. Conditional hardness assumes a conjecture (like SETH: Strong Exponential Time Hypothesis, stating k-SAT has no 2^((1 - epsilon)kn) algorithm) and uses fine-grained reductions to prove that problems are as hard as the conjecture, creating a web of equivalent hardness assumptions. These hardness assumptions explain why many natural problems resist faster algorithms despite polynomial-time solvability.

Explainer

Fine-grained complexity asks the next level of question after P vs. NP. Most problems in P have known polynomial-time algorithms, but which polynomials? Can you solve Longest Common Subsequence in O(n^1.5) instead of O(n^2)? Can you compute all-pairs shortest paths in O(n^3 - epsilon) for any epsilon > 0? These questions have resisted decades of algorithmic work, suggesting fundamental barriers — not absolute hardness like NP-completeness, but quantitative limits on what polynomial exponent is achievable.

The Strong Exponential Time Hypothesis (SETH) formalizes this intuition. It conjectures that k-SAT requires 2^((1 - o(1)) k n) time, i.e., the exponential dependence on clause size k is unavoidable. This is stronger than P != NP (which allows algorithms exponentially faster than exhaustive search), and it makes a specific quantitative prediction. From SETH, a web of conditional hardness can be derived: if SETH holds, then many other problems (3-SUM, APSP, LCS, edit distance) cannot be solved significantly faster than their current best algorithms. Fine-grained reductions translate the hardness — if a faster algorithm for APSP existed, it would contradict SETH.

The mechanism is reduction by simulation. A fine-grained reduction from APSP to another problem X uses an assumed O(n^3 - epsilon) solver for X to construct an O(n^3 - delta) solver for APSP, where delta is typically a small constant (like 0.01). The reduction maps instances and uses the solver repeatedly or compositionally. If APSP is believed to require O(n^3 - epsilon) time, then X must require at least O(n^2 - epsilon) time (or some other polynomial bound). This creates an equivalence class of problems under conditional hardness: all equivalent under SETH reductions, all conjectured to require the same polynomial exponent.

The 3-SUM problem (do three numbers in a set sum to zero?) is empirically the most important conditional hardness anchor. No algorithm faster than O(n^2) is known, and reductions from 3-SUM yield lower bounds for a broad family of geometric problems, string problems, and dynamic programming problems. Unlike SETH, which involves exponential-time, 3-SUM hardness is directly about polynomial-time problems. If 3-SUM genuinely requires O(n^2) (the 3-SUM conjecture), then any problem reducing to it does too, explaining quadratic barriers across disparate domains.

Fine-grained complexity is a research frontier: it provides conditional explanations for empirically hard problems without requiring breakthrough separation results like P != NP. It suggests that computational difficulty is not binary (polynomial vs. exponential) but stratified — a hierarchy of polynomial exponents, each defended by a conditional hardness conjecture. Whether SETH or 3-SUM is true remains open, but the web of reductions is robust: even if one conjecture fails, the fine-grained structure often transfers to others, giving nuanced explanations for algorithmic barriers.