OAI/Computability/FourierTransform/PolynomialPrograms.lean
33 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.PowerSaving.RAM.PolyCanline 12Source documentation
One algorithm; time is polynomial in (S+2), integer bounds polynomial in (B+2). Often S polylogarithmic in B.
def PolyCan {ι : Type U} (m : Bool) (B S : ι → ℕ) (s t) (x : ι → T s) (y : ι → T t) : Prop := … - theorem
OAI.PowerSaving.RAM.PolyCan.of_canline 21 - theorem
OAI.PowerSaving.RAM.PolyCan.congline 26 - theorem
OAI.PowerSaving.RAM.PolyCan.reindexline 31 - theorem
OAI.PowerSaving.RAM.PolyCan.poly_powerline 36 - theorem
OAI.PowerSaving.RAM.PolyCan.weakenline 39 - theorem
OAI.PowerSaving.RAM.PolyCan.pipeline 44 - theorem
OAI.PowerSaving.RAM.PolyCan.pairline 50 - theorem
OAI.PowerSaving.RAM.PolyCan.bindline 56 - theorem
OAI.PowerSaving.RAM.PolyCan.idline 63 - theorem
OAI.PowerSaving.RAM.PolyCan.fstline 66 - theorem
OAI.PowerSaving.RAM.PolyCan.sndline 71 - theorem
OAI.PowerSaving.RAM.PolyCan.firstline 76 - theorem
OAI.PowerSaving.RAM.PolyCan.secondline 79 - theorem
OAI.PowerSaving.RAM.PolyCan.wcline 82 - theorem
OAI.PowerSaving.RAM.PolyCan.zeroline 84 - theorem
OAI.PowerSaving.RAM.PolyCan.oneline 86 - theorem
OAI.PowerSaving.RAM.PolyCan.addline 90 - theorem
OAI.PowerSaving.RAM.PolyCan.subline 95 - theorem
OAI.PowerSaving.RAM.PolyCan.mulline 100 - theorem
OAI.PowerSaving.RAM.PolyCan.invline 105 - theorem
OAI.PowerSaving.RAM.PolyCan.lookline 111 - theorem
OAI.PowerSaving.RAM.PolyCan.lenline 115 - theorem
OAI.PowerSaving.RAM.PolyCan.waddline 120 - theorem
OAI.PowerSaving.RAM.PolyCan.wsubline 125 - theorem
OAI.PowerSaving.RAM.PolyCan.wmulline 130 - theorem
OAI.PowerSaving.RAM.PolyCan.wdivline 135 - theorem
OAI.PowerSaving.RAM.PolyCan.wmodline 140 - theorem
OAI.PowerSaving.RAM.PolyCan.wltline 145 - theorem
OAI.PowerSaving.RAM.PolyCan.loopline 149 - theorem
OAI.PowerSaving.RAM.PolyCan.tabline 163 - theorem
OAI.PowerSaving.RAM.PolyCan.sowline 174 - theorem
OAI.PowerSaving.RAM.PolyCan.testzline 188