scientific article
From MaRDI portal
Publication:3221885
zbMath0557.94018MaRDI QIDQ3221885
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boolean functionsmonotone computationssimulationslower boundscircuit complexityBoolean convolutionslice functionsclique functions
Related Items (14)
Bent functions and random Boolean formulas ⋮ On monotone simulations on nonmonotone networks ⋮ A hierarchy of propositional Horn formuls ⋮ Interior and exterior functions of Boolean functions ⋮ Optimal bounds for the approximation of Boolean functions and some applications ⋮ The powerset operator on abstract interpretations ⋮ Sensitivity vs. block sensitivity (an average-case study) ⋮ Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates ⋮ A nonlinear lower bound on the practical combinational complexity ⋮ Lower bounds on the area complexity of Boolean circuits ⋮ The multiplicative complexity of quadratic boolean forms ⋮ An extension of Khrapchenko's theorem ⋮ Prediction-preserving reducibility ⋮ Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
This page was built for publication:
