A lower bound on the monotone switching complexity of the threshold function T_n^n-1

DOI10.1515/DMA-2025-0026MaRDI QIDQ6854946zbMATH OpenFDO

Authors I. S. Sergeev

Publication date 23 February 2026

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/DMA-2025-0026

zbMATH Keywords

monotone computationsswitching networksthreshold functions

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cites work

• Better lower bounds for monotone threshold formulas
• scientific article; zbMATH DE number 609985 (Why is no real title available?)
• scientific article; zbMATH DE number 3207626 (Why is no real title available?)
• scientific article; zbMATH DE number 3214600 (Why is no real title available?)
• scientific article; zbMATH DE number 3261634 (Why is no real title available?)
• scientific article; zbMATH DE number 3313255 (Why is no real title available?)
• Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits
• Lower bounds to the complexity of symmetric Boolean functions

This page was built for publication: A lower bound on the monotone switching complexity of the threshold function \(T_n^{n-1}\)

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