Technical Reports (CIS)

Document Type

Technical Report

Date of this Version

August 1993


University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-93-73.


In this paper we prove a lower bound of Ω(n log n) for the common element problem on two sets of size n each. Two interesting consequences of this lower bound are also discussed. In particular, we show that linear space neural network models that admit unbalanced rules cannot draw all inferences in time independent of the knowledge base size. We also show that the join operation in data base applications needs Ω(log n) time given only n processors.



Date Posted: 21 August 2007