K. L. Rychkov, “On the Perfectness of Minimal Regular Partitions of the Edge Set of the n-Dimensional Cube”, J. Appl. Ind. Math., 13, № 4, 2019, 717
Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson, “Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation”, SIAM J. Comput., 46, № 1, 2017, 114
Stasys Jukna, Advances in Network Complexity, 2013, 99
Harry Vinall-Smeeth, Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024, 1
Reijo Jaakkola, Antti Kuusisto, Miikka Vilander, “Relating Description Complexity to Entropy”, Journal of Computer and System Sciences, 2024, 103615
Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, 1371
Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, 1359
Or Meir, “Toward Better Depth Lower Bounds: A KRW-like Theorem For Strong Composition”, SIAM J. Comput., 54, № 5, 2025, 1193