论文信息 - Near-optimal time-space tradeoff for element distinctness

Near-optimal time-space tradeoff for element distinctness

It was conjectured by A. Borodin et al. that to solve the element distinctness problem requires TS= Omega (n/sup 2/) on a comparison-based branching program using space S and time T, which, if true, would be close to optimal since TS=O(n/sup 2/ log n) is achievable. They showed recently (1987) that TS= Omega (n/sup 3/2/(log n)/sup 1/2/). The author shows a near-optimal tradeoff TS= Omega (n/sup 2- epsilon (n)/), where epsilon (n)=O(1/(log n)/sup 1/2/).<<ETX>>

Andrew Chi-Chih Yao | A. Yao

[1] C. Thomborson,et al. Area-time complexity for VLSI , 1979, STOC.

[2] Donald B. Johnson. A Simple Proof of a Time-Space Trade-Off for Sorting with Linear Comparisons , 1986, Theor. Comput. Sci..

[3] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .

[4] Allan Borodin,et al. A Time-Space Tradeoff for Element Distinctness , 1987, SIAM J. Comput..

[5] Allan Borodin,et al. A Time-Space Tradeoff for Sorting on Non-Oblivious Machines , 1981, J. Comput. Syst. Sci..

[6] Alan Cobham,et al. The Recognition Problem for the Set of Perfect Squares , 1966, SWAT.

[7] Saharon Shelah,et al. Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space , 1988, STOC.

[8] Martin Tompa. Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits , 1980, J. Comput. Syst. Sci..

[9] Allan Borodin,et al. A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation , 1982, SIAM J. Comput..

[10] Andrew Chi-Chih Yao. On the Time-Space Tradeoff for Sorting with Linear Queries , 1982, Theor. Comput. Sci..

[11] Mauricio Karchmer. Two Time-Space Tradeoffs for Element Distinctness , 1986, Theor. Comput. Sci..