Slacker News Slacker News logo featuring a lazy sloth with a folded newspaper hat
  • top
  • new
  • show
  • ask
  • jobs
Library
← Back to context

Comment by fooker

8 hours ago

You can’t put everything in a lookup table with the lookup cost being O(1).

If the things you have to memoize are super-linear, suppose you need to store some value related to all subsets of an input set of size n.

There’s no way you can do this in O(1), even assuming infinitely large memory.

0 comments

fooker

Reply

No comments yet

Contribute on Hacker News ↗

Slacker News

Product

  • API Reference
  • Hacker News RSS
  • Source on GitHub

Community

  • Support Ukraine
  • Equal Justice Initiative
  • GiveWell Charities