On minimal realizations of linear Boolean functions
From MaRDI portal
Publication:5263773
zbMATH Open1324.94072MaRDI QIDQ5263773FDOQ5263773
Publication date: 17 July 2015
Full work available at URL: http://mathnet.ru/eng/da689
Recommendations
linear Boolean functionminimal circuitcircuit of functional elementsstandard reductionstandard block
Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)
Cited In (20)
- Title not available (Why is that?)
- Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements
- Title not available (Why is that?)
- The minimal circuits for linear Boolean functions
- Multiplexor method for realization of Boolean functions by circuits composed of arbitrary logical elements
- Realization of systems of Boolean functions by linear arithmetic polynomials with masking
- Realization of Boolean functions by one linear arithmetic polynomial with masking
- Complexity and structure of circuits for parity functions
- Minimization of Boolean functions in the basis OR-NOT (AND-NOT)
- Title not available (Why is that?)
- From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
- Title not available (Why is that?)
- On minimal \(\pi\)-schemes for linear Boolean functions
- On the boolean minimal realization problem in the max-plus algebra
- The generalized complexity of linear Boolean functions
- Asymptotically minimal schemes for one sequence of Boolean functions
- On minimal circuits for linear functions over some bases
- The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits
- New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial
- Title not available (Why is that?)
This page was built for publication: On minimal realizations of linear Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263773)
