Documentation

Complexitylib.Metacomplexity.MCSP.Magnification.AntiChecker.Counter.Domain.Defs

Fixed-width anti-checker counter domains -- definitions #

Affine hashing acts directly on the fixed-width binary descriptions of valid bounded circuits. Each survivor has one canonical word, with no delimiter, parser branch, or padding multiplicity.

Fixed cube dimension for circuit descriptions at one arity and gate threshold.

Equations
Instances For

    One fixed-width word decodes to a valid description matching every labeled sample. Malformed count words and invalid descriptions are rejected.

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

      Canonical fixed-width words that decode to valid descriptions surviving a labeled sample vector.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        def Complexity.GapMCSP.Magnification.AntiCheckerLemma.encodedSurvivorSet {count : } (arity threshold : ) (input : BitString (count * (arity + 1))) :
        Finset (BitString (candidateCodeWidth arity threshold))

        The fixed-width survivor set associated with a packed labeled-sample input.

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