Isn’t 2^{n/logn} still faster-growing than any polynomial?
- 0 Posts
- 2 Comments
Joined 1 year ago
Cake day: June 25th, 2025
You are not logged in. If you use a Fediverse account that is able to follow users, you can follow this user.
Isn’t 2^{n/logn} still faster-growing than any polynomial?
Yeah, i think for a general community post like this, that sentence has too much subtext (SAT is NP-complete so if it was solved in polynomial time then the title of the post would be P=NP not something about ETH).
Anyways, there could always be a hard limit at like n/logn^2 or n/logn^1.000001 or something like that.