@InProceedings{chukhin_et_al:LIPIcs.STACS.2025.26,
  author =	{Chukhin, Nikolai and Kulikov, Alexander S. and Mihajlin, Ivan},
  title =	{{Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random Function}},
  booktitle =	{42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)},
  pages =	{26:1--26:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-365-2},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{327},
  editor =	{Beyersdorff, Olaf and Pilipczuk, Micha{\l} and Pimentel, Elaine and Thắng, Nguy\~{ê}n Kim},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.26},
  URN =		{urn:nbn:de:0030-drops-228513},
  doi =		{10.4230/LIPIcs.STACS.2025.26},
  annote =	{Keywords: complexity, formula complexity, lower bounds, Boolean functions, depth}
}