scientific article; zbMATH DE number 6460060
From MaRDI portal
Publication:5263827
zbMATH Open1324.94068MaRDI QIDQ5263827FDOQ5263827
Publication date: 17 July 2015
Full work available at URL: http://mathnet.ru/eng/da740
Title of this publication is not available (Why is that?)
Recommendations
- The minimal circuits for linear Boolean functions
- On minimal realizations of linear Boolean functions
- On minimal circuits for linear functions over some bases
- On minimal \(\pi\)-schemes for linear Boolean functions
- Complexity of realization of a linear Boolean function in Sheffer's basis
- Minimal contact circuits for a sequence of Boolean functions
- MINIMIZATION OF REPRESENTATIONS OF THE LOGICAL FUNCTION IN SCHAEFFER AND PIERCE BASES
- scientific article; zbMATH DE number 2210682
- Asymptotically minimal schemes for one sequence of Boolean functions
- scientific article; zbMATH DE number 2095572
Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)
Cited In (9)
- Title not available (Why is that?)
- Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements
- The minimal circuits for linear Boolean functions
- Lower bound of circuit complexity of parity function in a basis of unbounded fan-in
- Complexity and structure of circuits for parity functions
- A shortest 2-basis for Boolean algebra in terms of the Sheffer stroke
- The generalized complexity of linear Boolean functions
- On minimal circuits for linear functions over some bases
- New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial
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 Q5263827)
