Mauricio Karchmer, Ran Raz, Avi Wigderson, “Super-logarithmic depth lower bounds via the direct sum in communication complexity”, Comput Complexity, 5, № 3-4, 1995, 191
Satrajit Ghosh, Mark Simkin, 11693, Advances in Cryptology – CRYPTO 2019, 2019, 3
Kenya Ueno, “A stronger LP bound for formula size lower bounds via clique constraints”, Theoretical Computer Science, 434, 2012, 87
Susanna de Rezende, Or Meir, Jakob Nordstrom, Toniann Pitassi, Robert Robere, Marc Vinyals, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, 24
S. Laplante, T. Lee, M. Szegedy, 20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005, 76
Or Meir, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, 1056
Anna Gál, Pavel Pudlák, “A note on monotone complexity and the rank of matrices”, Information Processing Letters, 87, № 6, 2003, 321
Martin Grohe, Christoph Koch, Nicole Schweikardt, 3623, Fundamentals of Computation Theory, 2005, 1
Raimundo Briceño, Ivan Rapaport, “Communication complexity meets cellular automata: Necessary conditions for intrinsic universality”, Nat Comput, 20, № 2, 2021, 307
Joshua D. Laison, Yulan Qing, “Subspace intersection graphs”, Discrete Mathematics, 310, № 23, 2010, 3413