The following pages link to (Q4714495):
Displaying 12 items.
- Inversion complexity of self-correcting circuits for a certain sequence of Boolean functions (Q355279) (← links)
- Asymptotically minimal schemes for one sequence of Boolean functions (Q735559) (← links)
- Asymptotically best method for synthesis of Boolean recursive circuits (Q783110) (← links)
- Self-correcting schemes for functions of polynomial weight (Q1276026) (← links)
- On asymptotically minimal self-correcting schemes for a sequence of Boolean functions (Q1382560) (← links)
- The conjunction complexity asymptotic of self-correcting circuits for monotone symmetric functions with threshold 2 (Q2018031) (← 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)
- Complexity of self-correcting circuits for some sequence of Boolean functions (Q2513094) (← links)
- (Q3200995) (← links)
- A Note on Strongly Fault-Secure Sequential Circuits (Q3786419) (← links)
- Implementation of Linear Boolean Functions by Self-Correcting Circuits of Unreliable Logic Gates (Q6494792) (← links)
