Diameter Versus Certificate Complexity of Boolean Functions

DOI10.4230/LIPICS.MFCS.2021.31OpenAlexW3195540944MaRDI QIDQ6168445FDOQ6168445

Authors: Siddhesh Chaubal, Anna Gál 

Publication date: 8 August 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2021.31

Recommendations

• Sensitivity versus certificate complexity of Boolean functions
• Certificate complexity of elementary symmetric Boolean functions
• scientific article; zbMATH DE number 1866861
• Certificate complexity and symmetry of nested canalizing functions
• Boolean functions with a simple certificate for CNF complexity
• scientific article; zbMATH DE number 4108153
• On the modulo degree complexity of Boolean functions
• On the modulo degree complexity of Boolean functions
• scientific article; zbMATH DE number 4035741
• On the multiplicative complexity of Boolean functions

zbMATH Keywords

Boolean functionsblock sensitivitycertificate complexitylog-rank conjecturesensitivity conjecturealternating number

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Diameter Versus Certificate Complexity of Boolean Functions

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