[math-fun] Reverse is harder?

True, proving P unequal NP would be a needed first step to prove reverse is superpolynomially harder like cryptologists want. So... let us lower our goals... Can we prove for some problem, that the forward computation is some polynomial, while the backward is some higher-degree polynomial (at least)? Or... can we even prove a logarithmic gap -- I already proved one, but only for parallel computing; I want now a gap for ordinary sequential compute time. -- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)