An improved lower bound on the sensitivity complexity of graph properties

From MaRDI portal
Revision as of 06:57, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:551172

DOI10.1016/J.TCS.2011.02.042zbMath1217.68108OpenAlexW2039999266MaRDI QIDQ551172

Xiaoming Sun

Publication date: 14 July 2011

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

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




Related Items (2)




Cites Work




This page was built for publication: An improved lower bound on the sensitivity complexity of graph properties