scientific article; zbMATH DE number 3328172
From MaRDI portal
Publication:5606601
Recommendations
- Complexity of the realization of a linear Boolean function in the class of -schemes
- scientific article; zbMATH DE number 95249
- Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements
- The generalized complexity of linear Boolean functions
- Realization of linear functions by formulas in various bases
Cited in
(12)- Depth and polynomial equivalence of formulas for closed classes of two- valued logic
- The complexity of the realization of symmetrical functions by formulae
- Lower bounds for the size of expressions for certain functions in d-ary logic
- Representation of monomials as a sum of powers of linear forms
- Method of determining lower bounds for the complexity of \(\Pi\)-circuits
- On multiplexer function complexity in the -schemes class
- scientific article; zbMATH DE number 6007880 (Why is no real title available?)
- Sufficient conditions for the local repetition-freeness of minimal -schemes realizing linear Boolean functions
- scientific article; zbMATH DE number 4031582 (Why is no real title available?)
- scientific article; zbMATH DE number 95249 (Why is no real title available?)
- Complexity of the realization of a linear Boolean function in the class of -schemes
- On the structure of one class of perfect \(\Pi \)-partitions
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 Q5606601)
