Abstract
This paper proves the first superlogarithmic lower bounds on the cell probe complexity of dynamic Boolean (also known as decision) data structure problems, a long-standing milestone in data structu...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have