Reliability of nonbranching programs in an arbitrary complete finite basis
From MaRDI portal
Publication:1759235
DOI10.3103/S1066369X12020028zbMath1279.94158MaRDI QIDQ1759235
S. M. Grabovskaya, M. A. Alekhina
Publication date: 20 November 2012
Published in: Russian Mathematics (Search for Journal in Brave)
Related Items (5)
Upper bound of the circuits unreliability in a complete finite basis (in \(P_3\)) with arbitrary faults of elements ⋮ Upper estimate of unreliability of schemes in full finite basis (in \(P_2\)) for arbitrary faults of gates ⋮ An upper bound of unreliability of non-branching programs in an arbitrary complete finite basis for one-type constant faults at the outputs of computational operators ⋮ ON THE ARBITRARILY RELIABLE IMPLEMENTATION OF BOOLEAN FUNCTIONS BY NON-BRANCHING PROGRAMS WITH A CONDITIONAL STOP OPERATOR IN BASES WITH GENERALIZED CONJUNCTION ⋮ Asymptotically optimal in reliability circuits in two bases under failures of \(0\) \((k-1)\) type at the outputs of elements
Cites Work
This page was built for publication: Reliability of nonbranching programs in an arbitrary complete finite basis
