scientific article; zbMATH DE number 6789569

DOI10.4086/toc.2017.v013a007zbMath1379.68151OpenAlexW2963262068MaRDI QIDQ5368900

Justin Gilmer, Michal Koucký, Michael E. Saks

Publication date: 11 October 2017

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2017.v013a007

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

zbMATH Keywords

sensitivityBoolean functionsdecision treecommunication complexitycomplexity theorysensitivity conjecturedegree of Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Sensitivity Versus Certificate Complexity of Boolean Functions

This page was built for publication: