scientific article; zbMATH DE number 3889430

From MaRDI portal
Publication:3221885





[For the entire collection see Zbl 0544.00022.] For an important subclass of all Boolean functions - the so called slice functions - the circuit complexity over complete bases or the monotone basis are nearly of the same size since pseudo complements can be computed efficiently. Here the complexity of pseudo complements and the complexity of some slices of important functions like Boolean convolution and clique functions are investigated. Furthermore some new models are introduced which lead to new possibilities of proving lower bounds on the circuit complexity of Boolean functions.











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 Q3221885)