On the Sensitivity Complexity of k -Uniform Hypergraph Properties

DOI10.1145/3448643zbMath1495.68102OpenAlexW2962919971MaRDI QIDQ5065634

Qian Li, Xiaoming Sun

Publication date: 22 March 2022

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

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

zbMATH Keywords

Boolean functionsensitivity complexity\(k\)-uniform hypergraph propertiesTurán's question

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Elusive properties of infinite graphs

This page was built for publication: On the Sensitivity Complexity of k -Uniform Hypergraph Properties