On simultaneous resource bounds
暂无分享,去创建一个
[1] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.
[2] Stephen A. Cook,et al. Deterministic CFL's are accepted simultaneously in polynomial time and log squared space , 1979, STOC.
[3] Walter L. Ruzzo,et al. On uniform circuit complexity , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[4] Allan Borodin,et al. On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..
[5] Richard Edwin Stearns,et al. Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.
[6] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.
[7] Walter L. Ruzzo,et al. Tree-Size Bounded Alternation , 1980, J. Comput. Syst. Sci..
[8] Yuri Petrovich Ofman,et al. On the Algorithmic Complexity of Discrete Functions , 1962 .
[9] Michael J. Fischer,et al. Relations Among Complexity Measures , 1979, JACM.