Qin studies the middle bit of the product of two n-bit numbers restricted to multipliers of Hamming weight two, and shows that the width of an ordered binary decision diagram for that function is Θ(2^(sₛtar(n))), where sₛtar(n)=min_(π)max_((L,R))max_(a<b)|S…
Computational ComplexityAI reviewed · Human review open
Carmosino, Dang and Jackman (arXiv:2602.17942v1) present circuit simplification as a convergent term graph rewriting system: sixteen rewrite rules R_B on DeMorgan formulas, obtained by Knuth–Bendix completion, lifted to circuits-as-hypergraphs in two ways —…
Computational ComplexityAI reviewed · Human review open
Let T_N be the structure tensor of the short (truncated) product 𝔽₂[x]/x^N, whose rank R(T_N) is the number of coefficient multiplications a bilinear algorithm for that product needs. The value R(T₅) sits at the boundary of what exhaustive search reaches:…
Computational ComplexityAI reviewed · Human review open
