Invariance of complexity measures for networks with unreliable gates
暂无分享,去创建一个
[1] H. James Hoover,et al. Bounding Fan-out in Logical Networks , 1984, JACM.
[2] Nicholas Pippenger,et al. On networks of noisy gates , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[3] J. von Neumann,et al. Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .
[4] F. Hwang. Majorization on a partially ordered set , 1979 .
[5] David E. Muller,et al. Complexity in Electronic Switching Circuits , 1956, IRE Trans. Electron. Comput..
[6] Péter Gács,et al. Reliable computation with cellular automata , 1983, J. Comput. Syst. Sci..
[7] F. K. Hwang,et al. Comparisons on blocking probabilities for regular series parallel channel graphs , 1982, The Bell System Technical Journal.
[8] Nicholas Pippenger,et al. Analysis of Error Correction by Majority Voting , 1989, Adv. Comput. Res..
[9] Nicholas Pippenger,et al. Reliable computation by formulas in the presence of noise , 1988, IEEE Trans. Inf. Theory.
[10] Péter Gács,et al. A Simple Three-Dimensional Real-Time Reliable Cellular Array , 1988, J. Comput. Syst. Sci..
[11] Tomás Feder,et al. Reliable computation by networks in the presence of noise , 1989, IEEE Trans. Inf. Theory.