derandomization

Deterministic 3SUM in O(n^1.995782) and APSP / (min,+) / all-edges Exact Triangle in O(n^2.995943), improving Alman–Vassilevska Williams: proofs, certificates, Lean 4 checks, and a list of closed ideas to avoid duplicate work

Deterministic Subset Sum faster than meet-in-the-middle: 2^{0.4986298 n}, derandomising Ye–Li and OpenAI's 2^{0.49n} construction. Proofs, interval certificates, Lean 4 checks, and closed ideas. Preprint, not peer reviewed.

N queens counting as a rare event and a quantile integral, turned into a Monte Carlo program for P versus NP: NP = RP is shown equivalent to sampling queens completions, promise RP = promise P, which implies P = RP, is restated as a hitting set problem, with exact computations on the queens.