The Department of Computer Science at the University of Chicago

TR-91-13

Lower bounds for the complexity of reliable Boolean circuits with noisy gates

Gal, Anna. 9 April, 1991.

[ About Us | Education | People | Research | Facilities & Computing | Search this site | View Page Source | Contact Us | Site Map | Login ]
©2012 The University of Chicago® The Department of Computer Science
5730 S Ellis Ave, Chicago, IL 60637 :: ph 773.702.6614 :: fax 773.702.8487