scientific article; zbMATH DE number 609985

MaRDI QIDQ4301458zbMATH OpenFDO

Authors M. I. Grinchuk

Publication date 31 August 1995

zbMATH Keywords

complexity of normal sequencescontact schemesswitching circuitssymmetric Boolean functions

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• scientific article; zbMATH DE number 23013
• Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits
• scientific article; zbMATH DE number 4172394
• Lower bounds to the complexity of symmetric Boolean functions
• scientific article; zbMATH DE number 4137716
• scientific article; zbMATH DE number 15477
• scientific article; zbMATH DE number 919269
• scientific article; zbMATH DE number 850402
• Circuit complexity of symmetric Boolean functions in antichain basis
• scientific article; zbMATH DE number 4035741

Cited in

(7)

• The complexity of the standard multiplexer function in a class of switching circuits
• scientific article; zbMATH DE number 4137716 (Why is no real title available?)
• Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates
• scientific article; zbMATH DE number 23013 (Why is no real title available?)
• scientific article; zbMATH DE number 1564048 (Why is no real title available?)
• A simplified proof of a lower complexity estimate
• A lower bound on the monotone switching complexity of the threshold function \(T_n^{n-1}\)

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 Q4301458)