Pages that link to "Item:Q4308807"
From MaRDI portal
The following pages link to Lower bounds for the complexity of reliable Boolean circuits with noisy gates (Q4308807):
Displayed 7 items.
- Computing Boolean functions from multiple faulty copies of input bits (Q596147) (← links)
- On the design of reliable Boolean circuits that contain partially unreliable gates (Q1384528) (← links)
- Can large fanin circuits perform reliable computations in the presence of faults? (Q1575437) (← links)
- Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács (Q2686112) (← links)
- RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS (Q3144930) (← links)
- Average-Case Lower Bounds for Noisy Boolean Decision Trees (Q4210156) (← links)
- Locating Errors in Faulty Formulas (Q4972679) (← links)