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

DOI10.1016/0890-5401(89)90047-3zbMATH Open0682.06008OpenAlexW1974317370MaRDI QIDQ1823964FDOQ1823964

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4179291
• Multiplicative complexity of some Boolean functions
• The conjunctive complexity of quadratic Boolean functions
• scientific article; zbMATH DE number 4074972
• On the variables of the conjunctively polynomial-like Boolean functions

zbMATH Keywords

monotone functionssymmetric functionsBoolean functionsnumber of monomialsminimal cost of a polynomialnumber of literals

Mathematics Subject Classification ID

Boolean functions (06E30)

Cites Work

• Title not available (Why is that?)
• Strong versions of Sperner's theorem
• On the complexity of 2-output Boolean networks
• 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
• Boolesche Minimalpolynome und Überdeckungsprobleme
• On covering a product of sets with products of their subsets

Cited In (2)

• A conjecture about sums of disjoint products
• On converting CNF to DNF

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823964)