scientific article; zbMATH DE number 4091415
From MaRDI portal
Publication:3818992
zbMATH Open0666.94018MaRDI QIDQ3818992FDOQ3818992
Authors: D. Uhlig 
Publication date: 1988
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 4029459
- scientific article; zbMATH DE number 2123418
- The reliability of networks in the basis \((x \&{} y, x{\vee{}}y, {\bar x})\) in the case of constant faults of the same type at the outputs of the gates
- Lower bounds for the complexity of reliable Boolean circuits with noisy gates
- Reliable computation by networks in the presence of noise
Cited In (7)
- Invariance of complexity measures for networks with unreliable gates
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reliable computation by networks in the presence of noise
- Title not available (Why is that?)
- Boolean aspects of network reliability
- On the design of reliable Boolean circuits that contain partially unreliable gates
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818992)
