Two Time-Space Tradeoffs for Element Distinctness


Two time-space tradeoffs for element distinctness are given. The first one shows T2S = fl(n 3) on a branching program using minimum operations. By a result of Yao (1982), this implies the same bounds for linear queries. The second result extends one by Duffs and Galil (1984) who constructed a Boolean function that requires T2S = f~(n 3) on a k-headed Tuffng… (More)
DOI: 10.1016/0304-3975(86)90150-7


Cite this paper

@article{Karchmer1986TwoTT, title={Two Time-Space Tradeoffs for Element Distinctness}, author={Mauricio Karchmer}, journal={Theor. Comput. Sci.}, year={1986}, volume={47}, pages={237-246} }