Tight bounds for monotone switching networks via fourier analysis

DOI10.1145/2213977.2214024zbMath1286.94116OpenAlexW2101999477MaRDI QIDQ5415497

Aaron Potechin, Siu Man Chan

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2213977.2214024

zbMATH Keywords

lower boundsparallel complexityswitching networksspace complexitymonotone complexity

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Communication Lower Bounds via Critical Block Sensitivity

This page was built for publication: Tight bounds for monotone switching networks via fourier analysis