scientific article; zbMATH DE number 942481
From MaRDI portal
Publication:4714495
Recommendations
- On asymptotically minimal self-correcting schemes for a sequence of Boolean functions
- scientific article; zbMATH DE number 1285548
- Complexity of self-correcting circuits for some sequence of Boolean functions
- scientific article; zbMATH DE number 4187722
- scientific article; zbMATH DE number 1285549
- Asymptotically minimal schemes for one sequence of Boolean functions
- Inversion complexity of self-correcting circuits for a certain sequence of Boolean functions
- scientific article; zbMATH DE number 850403
- Complexity of realization of Boolean functions with small number of unit values by selfcorrecting contact circuits
- Minimal contact circuits for a sequence of Boolean functions
Cited in
(18)- Self-correcting schemes for functions of polynomial weight
- On asymptotically minimal self-correcting schemes for a sequence of Boolean functions
- The conjunction complexity asymptotic of self-correcting circuits for monotone symmetric functions with threshold 2
- On self-correcting logic circuits of unreliable gates with at most two inputs
- On self-correcting logic circuits of unreliable gates
- Complexity of self-correcting circuits for some sequence of Boolean functions
- Proof of lower estimates for the complexity of self-correcting circuits by the method of basis changing
- scientific article; zbMATH DE number 4176986 (Why is no real title available?)
- Inversion complexity of self-correcting circuits for a certain sequence of Boolean functions
- A Note on Strongly Fault-Secure Sequential Circuits
- scientific article; zbMATH DE number 1285548 (Why is no real title available?)
- scientific article; zbMATH DE number 1285549 (Why is no real title available?)
- scientific article; zbMATH DE number 2032362 (Why is no real title available?)
- scientific article; zbMATH DE number 850403 (Why is no real title available?)
- scientific article; zbMATH DE number 4187722 (Why is no real title available?)
- Implementation of Linear Boolean Functions by Self-Correcting Circuits of Unreliable Logic Gates
- Asymptotically minimal schemes for one sequence of Boolean functions
- Asymptotically best method for synthesis of Boolean recursive circuits
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4714495)
