Can large fanin circuits perform reliable computations in the presence of faults?

Theoretical Computer Science

Volumn 240, Issue 2, 2000, Pages 319-335

  Reischuk, Rüdiger ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346639541     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00237-6     Document Type: Article

References (16)

1. R. Boppana, M. Sipser, The complexity of finite functions, in: J. v. Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity, Elsevier, Amsterdam, 1990, pp. 759-804.
2. R. Dobrushin, S. Ortyukov, Lower bound for the redundancy of self-correcting arrangements of unreliable functional elements, Probab. Inform. Trans. 13 (1977) 59-65.
3. R. Dobrushin, S. Ortyukov, Upper bound for the redundancy of self-correcting arrangements of unreliable functional elements, Probab. Inform. Trans. 13 (1977) 203-218.
4. A. Gál, Lower bounds for the complexity of reliable boolean circuits with noisy gates, Proc. 32. IEEE Symp. on Foundations of Computer Science, FOCS'91, 1991, pp. 602-611.
5. A. Gál, P. Gács, Lower bounds for the complexity of reliable boolean circuits with noisy gates, IEEE Trans. Inform. Theory 40 (1994) 579-583.
6. M. Goldmann, J. Håstad, A. Razborov, Majority gates vs. general weighted threshold gates, Proc. 7. Structure in Complexity Theory, STRUCTURES'92, 1992, pp. 2-13.
7. M. Goldmann, M. Karpinski, Simulating threshold circuits by majority circuits, Proc. 25. ACM Symp on the Theory of Computing, STOC'93, 1993, pp. 551-560.
8. A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, G. Turán, Threshold circuits of bounded depth, J. CSS 46 (1993) 129-154.
9. T. Hofmeister, A note on the simulation of exponential threshold weights, Proc. 2. Int. Conf. Computing and Combinatorics, COCOON'96, Springer, Lecture Notes in Computer Science, Vol. 1090, 1996, pp. 136-141.
10. J. von Neumann, Probabilistic logics and the synthesis of reliable organisms from unreliable components, in: C. Shannon, J. McCarthy (Ed.), Automata Studies, Princeton University Press, 1956, Princeton, NJ, pp. 43-98.
11. N. Pippenger, On Networks of noisy gates, Proc. 26. IEEE Symp. on Foundations of Computer Science, FOCS'85, 1985, pp. 30-38.
12. N. Pippenger, Invariance of complexity measures for networks with unreliable gates, J. ACM 36 (1989) 531-539.
13. N. Pippenger, G. Stamoulis, J. Tsitsiklis, On a lower bound for the redundancy of reliable networks with noisy gates, IEEE Trans. Inform. Theory 37 (1991) 639-643.
14. R. Reischuk, B. Schmeltz, Area efficient methods to increase the reliability of boolean circuits, Proc. 6. GI-AFCET Symp. on Theoretical Aspects of Computer Science, STACS'89, Springer, Lecture Notes in Computer Science, Vol. 349, 1989, pp. 314-326.
15. R. Reischuk, B. Schmeltz, Reliable computation with noisy circuits, a general n log n lower bound, Proc. 32. IEEE Symp. on Foundations of Computer Science, FOCS'91, 1991, pp. 594-601.
16. I. Wegener, The Complexity of Boolean Functions, Teubner, Stuttgart, 1987.