Minimal polynomials for the conjunction of functions on disjoint variables can be very simple
From MaRDI portal
Publication:1823964
DOI10.1016/0890-5401(89)90047-3zbMath0682.06008MaRDI QIDQ1823964
Publication date: 1989
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(89)90047-3
Boolean functions; symmetric functions; monotone functions; number of monomials; minimal cost of a polynomial; number of literals
06E30: Boolean functions
Related Items
Cites Work
- Unnamed Item
- On the complexity of 2-output Boolean networks
- Boolesche Minimalpolynome und Überdeckungsprobleme
- On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
- Realizing Boolean functions on disjoint sets of variables
- Strong versions of Sperner's theorem
- On covering a product of sets with products of their subsets