ConceptTheory & Algos
Predecessor problem lower bound
A theoretical limit on the time complexity required to solve the predecessor problem on a RAM model.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.