The Time-Precision Tradeoff Problem on On-Line Probabilistic Turing Machines
暂无分享,去创建一个
[1] John Gill,et al. Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers , 1980, Theor. Comput. Sci..
[2] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[3] John Gill,et al. Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..
[4] F. C. Hennie,et al. On-Line Turing Machine Computations , 1966, IEEE Trans. Electron. Comput..
[5] Rusins Freivalds,et al. Probabilistic Machines Can Use Less Running Time , 1977, IFIP Congress.
[6] Michael O. Rabin,et al. Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..
[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[8] Tadao Kasami. A Note on Computing Time for Recognition of Languages Generated by Linear Grammars , 1967, Inf. Control..
[9] Hervé Gallaire,et al. Recognition Time of Context-Free Languages by On-Line Turing Machines , 1969, Inf. Control..
[10] Janos Simon,et al. On Tape-Bounded Probabilistic Turing Machine Acceptors , 1981, Theor. Comput. Sci..
[11] J. Hammersley,et al. Monte Carlo Methods , 1965 .
[12] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..
[13] Michael O. Rabin. N-Process Synchronization by 4 log _2 N-Valued Shared Variables , 1980, FOCS.