Pages that link to "Item:Q1226990"
From MaRDI portal
The following pages link to On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements (Q1226990):
Displayed 11 items.
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- On the complexity of 2-output Boolean networks (Q1159183) (← links)
- Geometric arguments yield better bounds for threshold circuits and distributed computing (Q1365681) (← links)
- Stochastic analog networks and computational complexity (Q1578510) (← links)
- The choice and agreement problems of a random function (Q1705694) (← links)
- The direct sum of universal relations (Q1751432) (← links)
- Minimal polynomials for the conjunction of functions on disjoint variables can be very simple (Q1823964) (← links)
- \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice (Q1904667) (← links)
- On self-correcting logic circuits of unreliable gates with at most two inputs (Q2113411) (← links)
- On self-correcting logic circuits of unreliable gates (Q2241352) (← links)
- On the computational power of probabilistic and faulty neural networks (Q4632413) (← links)