Lower bounds for the complexity of reliable Boolean circuits with noisy gates
From MaRDI portal
Publication:4308807
DOI10.1109/18.312190zbMath0807.94021OpenAlexW2086652199MaRDI QIDQ4308807
Publication date: 5 March 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8f92b5c1cc378f21f941751482855cab45267f95
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Computing Boolean functions from multiple faulty copies of input bits ⋮ On the design of reliable Boolean circuits that contain partially unreliable gates ⋮ Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács ⋮ Locating Errors in Faulty Formulas ⋮ Can large fanin circuits perform reliable computations in the presence of faults? ⋮ Average-Case Lower Bounds for Noisy Boolean Decision Trees ⋮ RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
This page was built for publication: Lower bounds for the complexity of reliable Boolean circuits with noisy gates
