Composition limits and separating examples for some Boolean function complexity measures
From MaRDI portal
Publication:1701350
DOI10.1007/s00493-014-3189-xzbMath1399.68074arXiv1306.0630MaRDI QIDQ1701350
Srikanth Srinivasan, Justin Gilmer, Michael E. Saks
Publication date: 22 February 2018
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.0630
Related Items
Unnamed Item, Unnamed Item, New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity, Quadratically tight relations for randomized query complexity, On block sensitivity and fractional block sensitivity, On derandomized composition of Boolean functions, Unnamed Item, All Classical Adversary Methods are Equivalent for Total Functions
Cites Work