Documentation

Complexitylib.Circuits.AC0.Switching.Collection.Defs

Simultaneous switching for finite formula collections -- definitions #

These are finite, nonuniform collections indexed by Fin formulaCount; they are unrelated to uniform circuit-family generators.

noncomputable def Complexity.DNF.switchingAnyBad {formulaCount N : } (formulas : Fin formulaCountDNF N) (queryCount : ) (restriction : Restriction.On N) :

At least one DNF in a finite collection has a deep switching tree.

Equations
Instances For
    @[implicit_reducible]
    noncomputable instance Complexity.DNF.switchingAnyBadDecidable {formulaCount N : } (formulas : Fin formulaCountDNF N) (queryCount : ) :
    DecidablePred (switchingAnyBad formulas queryCount)
    Equations
    noncomputable def Complexity.DNF.consistentParts {formulaCount N : } (formulas : Fin formulaCountDNF N) :
    Fin formulaCountDNF N

    Clean every DNF in a finite collection.

    Equations
    Instances For
      noncomputable def Complexity.CNF.switchingAnyBad {formulaCount N : } (formulas : Fin formulaCountCNF N) (queryCount : ) (restriction : Restriction.On N) :

      At least one CNF in a finite collection has a deep switching tree.

      Equations
      Instances For
        @[implicit_reducible]
        noncomputable instance Complexity.CNF.switchingAnyBadDecidable {formulaCount N : } (formulas : Fin formulaCountCNF N) (queryCount : ) :
        DecidablePred (switchingAnyBad formulas queryCount)
        Equations
        noncomputable def Complexity.CNF.consistentParts {formulaCount N : } (formulas : Fin formulaCountCNF N) :
        Fin formulaCountCNF N

        Clean every CNF in a finite collection.

        Equations
        Instances For