Information Technology Reference
In-Depth Information
[367] A. C-C. Yao, “The Entropic Limitations on VLSI Computations,” Proc. 13thAnn. ACMSymp.
TheoryofComputing(1981), 308-311.
[368] A. C-C. Yao, “Separating the Polynomial-Time Hierarchy by Oracles,” Proc. 26th Ann. IEEE
Symp.FoundationsofComputerScience(1985), 1-10.
[369] A. C-C. Yao, “Near-Optimal Time-Space Tradeoff for Element Distinctness,” Proc. 29st Ann.
IEEESymp.FoundationsofComputerScience(1988), 91-97.
[370] Y. Yesha, “Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform on
Any General Sequential Random-Access Computer,” J.Comp.SystemsSci. 29 (1984), 183-197.
[371] D. H. Younger, “Recognition and Parsing of Context-Free Languages in Time
n
3
,” Info.andCon-
trol 10 (1967), 189-208.
[372] D. Zhou, F. P. Preparata, and S. M. Khang, “Interconnection Delay in Very High-Speed VLSI,”
IEEETrans.CircuitsandSystems 38 (1991), 779-790.
[373] U. Zwick, “Optimizing Neciporuk's Theorem,” Dept. Computer Science, Tel Aviv Univ., Tech.
Report 86/1987, 1987.
[374] U. Zwick, “A 4
n
Lower Bound on the Combinational Complexity of Certain Symmetric Boolean
Functions over the Basis of Unated Dyadic Boolean Functions,” SIAM J. Comput. 20 (1991),
499-505.