perf: choose balanced `Sym.simp` certificates by a kernel cost model

This PR makes `Sym.simp` arithmetic normalization choose between the balanced and the sequential polynomial certificates by estimating their kernel cost, instead of by the size of the input, which selected the balanced certificates for sums written in an order the sequential additions handle in linear time.

The normalizer counts the monomial comparisons of both algorithms on the actual polynomials, together with the number of polynomials the balanced algorithm adds as lists, for sums of at least 12 summands and polynomials with at least 32 monomials. `Poly.mulB_k` and `Poly.mulBC_k` now multiply directly when a factor is a constant or a single monomial, which removes most of the list overhead of summands such as `3 * x * y`.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
3 files changed