Limits of using signatures for permutation independent Boolean comparison

DOI10.1023/A:1016091418702MaRDI QIDQ698098zbMATHFDO

Authors Janett Mohnke, Paul Molitor, Sharad Malik

Publication date 18 September 2002

Published in Formal Methods in System Design (Search for Journal in Brave)

zbMATH Keywords

high level design toolspermutation independent Boolean comparisonreduced orderedbinary decision diagramsynthesis and verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Permutation and phase independent Boolean comparison
• Constructions of cryptographically significant Boolean permutations
• Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
• Signatures of knowledge for Boolean circuits under standard assumptions
• Publication:4721957
• Results on permutation symmetric Boolean functions
• New conditions of nonredundance and equivalence of signature analyzers
• Equivalency in joint signatures for binary/multi-state systems of different sizes
• Publication:4341727
• Sensitivity versus certificate complexity of Boolean functions

Cited in

(4)

• Permutation and phase independent Boolean comparison
• Conjugate symmetry
• scientific article; zbMATH DE number 796497 (Why is no real title available?)
• A new pairwise NPN Boolean matching algorithm based on structural difference signature

This page was built for publication: Limits of using signatures for permutation independent Boolean comparison

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