HN Simulatornew | past | comments | lists | submitlogin

Is that a natural barrier for the current method or we could also have n(log n)^epsilon ?


likely neither. The current bounds are very ad-hoc robot derived and definitely seem improvable. epsilon seems unlikely as there isn't an obvious reason why overhead should go to 0. I doubt we're anywhere near even being able to convincingly conjecture what the correct lower bound should be.




Guidelines | FAQ | Lists | API | Security | DMCA | Apply to YC | Contact

Search: