scientific article; zbMATH DE number 7559433

DOI10.4230/LIPIcs.MFCS.2020.62MaRDI QIDQ5089234

Reza Naserasr, Anupa Sunny, Sophie Laplante

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

sensitivityBoolean functionspolynomial degree

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

On the signed chromatic number of some classes of graphs ⋮ Tight bounds on sensitivity and block sensitivity of some classes of transitive functions

Cites Work

• Unnamed Item
• On induced subgraphs of the cube
• Signed graphs
• The equivalence of two problems on the cube
• Complexity measures and decision tree complexity: a survey.
• Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• Properties and applications of boolean function composition
• Minimum number of distinct eigenvalues of graphs

This page was built for publication: