On Detecting Total or Partial Symmetry of Switching Functions

DOI10.1109/T-C.1971.223243MaRDI QIDQ5623600zbMATH OpenOpenAlexFDO

Authors C. L. Sheng, Sunil R. Das

Publication date 1971

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

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

Mathematics Subject Classification ID

Recommendations

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

Cited in

(9)

• Sensitivities and block sensitivities of elementary symmetric Boolean functions
• Certificate complexity of elementary symmetric Boolean functions
• Symmetric multi-valued logic functions: characterization and synthesis
• Testing 2-asummability using a property of canonical extremal vertices
• scientific article; zbMATH DE number 1112806 (Why is no real title available?)
• Certificate complexity and symmetry of nested canalizing functions
• Partially symmetric functions are efficiently isomorphism testable
• Detection of Totally Symmetric Boolean Functions
• An Iterative Technique for Determining the Minimal Number of Variables for a Totally Symmetric Function with Repeated Variables

This page was built for publication: On Detecting Total or Partial Symmetry of Switching Functions

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