New lower bounds on the complexity of several searching problems are established. It is shown that the time for solving the partial sum problem on n points in d dimensions is at least proportional to (log n/log (2m/n))**d- **1 in both the worst and average cases, where m denotes the amount of storage used. This bound is probably tight for m equals OMEGA (n log**c n) and any c greater than d-1. A lower bound of OMEGA (n(log n/log log n)**d ) on the time required for executing n inserts and queries is also proved. Other results are presented.
|Original language||English (US)|
|Title of host publication||Annual Symposium on Foundations of Computer Science (Proceedings)|
|Number of pages||10|
|State||Published - Dec 1 1986|
All Science Journal Classification (ASJC) codes
- Hardware and Architecture