Documentation

Complexitylib.Algebraic.LowerBound.Cutwidth.Extractor.SourceReduction.Construction.Uniform.Defs

Bounded parameters for one uniform source-reduction family #

The scale is the ceiling logarithm of the original input length plus one. The outer count is then a fixed power of a rounded input length. The Gamma candidate count is capped by the original input length plus one, ensuring polynomial-time enumeration on every input. The asymptotic theorem will show that this cap is eventually inactive.

The scale shared by every component at input length n.

Equations
Instances For

    A uniformly bounded candidate count, agreeing eventually with the actual Gamma count.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      One total evaluator with all enumeration counts generated from the input length.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        The single explicit family used for the coefficient-four circuit lower bound.

        Equations
        Instances For