Construction of universal enumerators and formulas for threshold functions

DOI10.1007/BF00970276zbMath0674.94028MaRDI QIDQ1121855

L. S. Khasin, Rafail E. Krichevsky

Publication date: 1988

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

Boolean functionsT-threshold functionuniversal numerator

Mathematics Subject Classification ID

Boolean functions (06E30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded-depth, polynomial-size circuits for symmetric functions
• An explicit construction of short monotone formulae for the monotone symmetric functions
• The covering problem of complete uniform hypergraphs
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Optimal hashing
• Should Tables Be Sorted?
• Constructing $O(n\log n)$ Size Monotone Formulae for the kth Threshold Function of n Boolean Variables

This page was built for publication: Construction of universal enumerators and formulas for threshold functions