scientific article; zbMATH DE number 5849341
From MaRDI portal
Publication:3074627
analysisBoolean functioncircuit of functional elementscomplexitydecompositiondifference equationdimensionformulafunctional equationminimizationmulticriteria optimizationquality characteristicssynthesis
Recommendations
- On the complexity of realisation of Zhegalkin polynomials
- On the complexity of symmetric polynomials
- On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials
- Tropicalization, symmetric polynomials, and complexity
- On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials
- scientific article; zbMATH DE number 1303912
- On the Complexity of Polynomial Zeros
- On complexity of realisation of a class of almost symmetric functions by formulas of depth 3
- scientific article; zbMATH DE number 165425
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
Cited in
(10)- The use of symmetric variables for reducing the complexity of logical circuits
- Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits
- Synthesis of adaptive logical networks on the basis of Zhegalkin polynomials
- scientific article; zbMATH DE number 3882345 (Why is no real title available?)
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem
- scientific article; zbMATH DE number 3930906 (Why is no real title available?)
- scientific article; zbMATH DE number 3968581 (Why is no real title available?)
- scientific article; zbMATH DE number 1839514 (Why is no real title available?)
- On the complexity of realisation of Zhegalkin polynomials
- Mathematical models for intellectualization of synthesis of discrete logical control units
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 Q3074627)
