Construction of universal enumerators and formulas for threshold functions

DOI10.1007/BF00970276MaRDI QIDQ1121855zbMATH OpenFDO

Authors L. S. Khasin, Rafail E. Krichevsky

Publication date 1988

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

Full work available at URL https://doi.org/10.1007/BF00970276

zbMATH Keywords

Boolean functionsT-threshold functionuniversal numerator

Mathematics Subject Classification ID

Boolean functions (06E30)

Review text

See the review in Zbl 0659.94018.

Cites work

• An explicit construction of short monotone formulae for the monotone symmetric functions
• Bounded-depth, polynomial-size circuits for symmetric functions
• Constructing $O(n\log n)$ Size Monotone Formulae for the kth Threshold Function of n Boolean Variables
• scientific article; zbMATH DE number 3120835 (Why is no real title available?)
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 3478758 (Why is no real title available?)
• scientific article; zbMATH DE number 3607492 (Why is no real title available?)
• scientific article; zbMATH DE number 3261634 (Why is no real title available?)
• scientific article; zbMATH DE number 3328173 (Why is no real title available?)
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Optimal hashing
• Should Tables Be Sorted?
• The covering problem of complete uniform hypergraphs

Cited in

(1)

• A complete classification of equational classes of threshold functions included in clones

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121855)