[AnotherGoodName]

mLog^(x/3) complexity intrigues me because i’ve seen it before in unrelated contexts (with different values for m but regardless..). Another example is the beat known integer factorisation and related discrete logarithms algorithms.

https://en.wikipedia.org/wiki/General_number_field_sieve

It’s such an out of nowhere part of complexity statements (what’s special about ‘x/3’?!) that i have to wonder if there’s some underlying relation.

Integer factorisation and discrete logarithm solving do look a lot like a type of search.

I feel it’s possibly similar to the moonshine theory where different fields kept producing the same (or 1 off from the same) out of nowhere number and for the longest time no one saw the link between them.

[WalterGR]

> moonshine theory

Interesting - I hadn’t heard that term. Wikipedia link for anyone curious: https://en.wikipedia.org/wiki/Monstrous_moonshine

The term was coined by John Conway of Conway’s Game of Life.