A Time-Space Tradeoff for Element Distinctness
暂无分享,去创建一个
In "A Time Space Tradeoff for Sorting on non-Oblivious Machines", Borodin et al. [B - 81] proved that to sort n elements requires TS = Ω(n2) where T=time and S=space on a comparison based branching problem. Although element distinctness and sorting are equivalent problems on a computation tree, the stated tradeoff result does not immediately follow for element distinctness or indeed for any decision problem. In this paper, we are able to show that TS=Ω(n3/2) for deciding element distinctness (or the sign of a permutation).
[1] Alan Cobham,et al. The Recognition Problem for the Set of Perfect Squares , 1966, SWAT.
[2] Edward M. Reingold,et al. On the Optimality of Some Set Algorithms , 1972, JACM.
[3] Martin Tompa. Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits , 1980, J. Comput. Syst. Sci..
[4] Allan Borodin,et al. A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation , 1982, SIAM J. Comput..