On the sensitivity complexity of bipartite graph properties

DOI10.1016/j.tcs.2012.11.006zbMath1266.68117OpenAlexW1974514669MaRDI QIDQ1935792

Jieming Mao, Yihan Gao, Xiaoming Sun, Song Zuo

Publication date: 19 February 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.006

zbMATH Keywords

bipartite graphgraph propertiesdecision treesensitivity complexityTuran conjecture

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On the relationship between energy complexity and other Boolean function measures

This page was built for publication: On the sensitivity complexity of bipartite graph properties