scientific article; zbMATH DE number 3328173
From MaRDI portal
Publication:5606602
zbMath0206.29005MaRDI QIDQ5606602
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
\(\Sigma\Pi\Sigma\) threshold formulas ⋮ Information compression and Varshamov-Gilbert bound ⋮ Construction of universal enumerators and formulas for threshold functions ⋮ On the maximum number of qualitative independent partitions ⋮ Homogeneous formulas and symmetric polynomials ⋮ Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates ⋮ Lower bounds for the size of expressions for certain functions in d-ary logic ⋮ An explicit construction of short monotone formulae for the monotone symmetric functions ⋮ On the depth complexity of formulas ⋮ The covering problem of complete uniform hypergraphs ⋮ Symbolic model checking for \(\mu\)-calculus requires exponential time ⋮ Bounded-depth, polynomial-size circuits for symmetric functions
This page was built for publication:
