A Lower Bound Result for the Common Element Problem and Its Implication for Reflex ive Reasoning
Year: 1993
Type: article
Abstract: 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. Comments
Institution: University of Pennsylvania
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2164298720