Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Anna Gál. Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates. In 32nd Annual Symposium on Foundations of Computer Science, 1-4 October 1991, San Juan, Puerto Rico. pages 594-601, IEEE, 1991.
Abstract is missing.