scientific article; zbMATH DE number 3328173
From MaRDI portal
Publication:5606602
Cited in
(12)- Bounded-depth, polynomial-size circuits for symmetric functions
- Information compression and Varshamov-Gilbert bound
- Construction of universal enumerators and formulas for threshold functions
- On the maximum number of qualitative independent partitions
- 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
- The covering problem of complete uniform hypergraphs
- \(\Sigma\Pi\Sigma\) threshold formulas
- Symbolic model checking for -calculus requires exponential time
- On the depth complexity of formulas
- Homogeneous formulas and symmetric polynomials
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
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 Q5606602)
