Construction of universal enumerators and formulas for threshold functions
type: Item
instance of: scholarly article
title: Construction of universal enumerators and formulas for threshold functions
zbMATH Open document ID: 0674.94028
DOI: 10.1007/BF00970276
author: L. S. Khasin
author: Rafail E. Krichevsky
published in: Siberian Mathematical Journal
publication date: 1988-01-01T00:00:00Z
review text: See the review in Zbl 0659.94018.
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 4104875
zbMATH Keywords: Boolean functions
zbMATH Keywords: T-threshold function
zbMATH Keywords: universal numerator
MaRDI profile type: Publication
cites work: Q3235794
cites work: Q5606602
cites work: Q5547602
cites work: An explicit construction of short monotone formulae for the monotone symmetric functions
cites work: Constructing $O(n\log n)$ Size Monotone Formulae for the kth Threshold Function of n Boolean Variables
cites work: Bounded-depth, polynomial-size circuits for symmetric functions
cites work: The covering problem of complete uniform hypergraphs
cites work: Q4172915
cites work: Q3762226
cites work: On the Size of Separating Systems and Families of Perfect Hash Functions
cites work: Should Tables Be Sorted?
cites work: Q4063339
cites work: Optimal hashing
description: scientific article; zbMATH DE number 4104875