Answers are grounded in this paper and cite their sources.
We show that n × n permanents can be computed with O^*(2-ε)ⁿ arithmetic operations over every commutative ring, for ε = 10⁻⁴⁰. This solves a problem stated in Knuth's The Art of Computer Programming. Our algorithm implements the classical Binet--Minc identity with dynamic programming and careful bookkeeping. It also gives algebraic branching programs of size O^*(2-ε)ⁿ.
No takes yet. Share an insight, caveat, or question.
Radu Curticapean (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: