Minimal polynomials for the conjunction of functions on disjoint variables can be very simple

DOI10.1016/0890-5401(89)90047-3zbMath0682.06008OpenAlexW1974317370MaRDI QIDQ1823964

Bernd Voigt, Ingo Wegener

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

zbMATH Keywords

Boolean functionssymmetric functionsmonotone functionsnumber of monomialsminimal cost of a polynomialnumber of literals

Mathematics Subject Classification ID

Boolean functions (06E30)

Related Items (1)

On converting CNF to DNF

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

This page was built for publication: Minimal polynomials for the conjunction of functions on disjoint variables can be very simple