On Identification of Totally Symmetric Boolean Functions

DOI10.1109/T-C.1970.222997MaRDI QIDQ5591532zbMATH OpenOpenAlexFDO

Authors Nripendra N. Biswas

Publication date 1970

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/t-c.1970.222997

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Detection of Totally Symmetric Boolean Functions
• A Dynamic Programming Approach to Sequential Pattern Recognition
• scientific article; zbMATH DE number 1112806
• scientific article; zbMATH DE number 59496
• Symmetric Boolean Functions

Cited in

(6)

• Detection of Totally Symmetric Boolean Functions
• A Dynamic Programming Approach to Sequential Pattern Recognition
• On Detecting Total or Partial Symmetry of Switching Functions
• An Iterative Technique for Determining the Minimal Number of Variables for a Totally Symmetric Function with Repeated Variables
• scientific article; zbMATH DE number 1303958 (Why is no real title available?)
• Generalized Reed-Muller forms as a tool to detect symmetries

This page was built for publication: On Identification of Totally Symmetric Boolean Functions

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