Re:Complexity Theory’s 50-Year Journey to the Limits of Know...
by krackers on Friday August 18, 2023 @09:19PM
(#37184426)
If you are willing to settle for expected instead of worst case time, there are many string-related algorithms that are O(m/n). Intuition is that as the string size grows it's "more likely" to have some property on expectation.
[ Parent
| on HN ]
Re:Complexity Theory’s 50-Year Journey to the Limits of Know...
by PartiallyTyped on Sunday August 20, 2023 @04:47AM
(#37197301)
Same for hash related algorithms and data structures.