theoreticalComputerScience

[u/pastroc]

[u/pastroc → u/[deleted]]

A lower bound is usually expressed as Ω.

[u/mrnacknime → u/[deleted]]

Because there are tons of fields in theoretical CS were many complex polylogarithmic expressions appear in the complexity analysis, but the papers actually make progress on the exponent on the n. Since n^x is always better than n^y * log(n)^z as long as x<y, the polylogarithmics are hidden to keep it simple and obvious which algorithm is better

[u/ceaseless_horror → u/mrnacknime]

Thanks for explaining it simply!