I think I would write “We show the NP-complete problem X can be solved in time O(T) by an exact algorithm. No o(T) algorithm is known for any NP-complete problem.” But you had better be sure about that second statement. I’d also write O((1 + 1 / lg n)^n) as O(e^{n / lg n}).

Is there a moderation queue on the subreddit? I made a post about an hour ago, but I can’t see it under new if I log out. Not the first time that’s happened to me.

Don’t know. @spdegabrielle ?

Yes - let me check

@popa.bogdanp did that fix it?

Yup. Thanks!