- Hao Huang, Benny Sudakov, “A counterexample to the Alon-Saks-Seymour conjecture and related problems”, Combinatorica, 32, no. 2, 2012, 205
![https://doi.org/10.1007/s00493-012-2746-4 crossref](/refsvg/svg/crossref.svg)
- Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie, “On order and rank of graphs”, Combinatorica, 35, no. 6, 2015, 655
![https://doi.org/10.1007/s00493-015-2922-4 crossref](/refsvg/svg/crossref.svg)
- P. Pudlák, V. Rödl, “Some combinatorial-algebraic problems from complexity theory”, Discrete Mathematics, 136, no. 1-3, 1994, 253
![https://doi.org/10.1016/0012-365X(94)00115-Y crossref](/refsvg/svg/crossref.svg)
- N. Nisan, A. Wigderson, Proceedings 35th Annual Symposium on Foundations of Computer Science, 1994, 831
![https://doi.org/10.1109/SFCS.1994.365711 crossref](/refsvg/svg/crossref.svg)
- Panos M. Pardalos, Thelma Mavridou, Jue Xue, Handbook of Combinatorial Optimization, 1998, 1077
![https://doi.org/10.1007/978-1-4613-0303-9_16 crossref](/refsvg/svg/crossref.svg)
- Ran Raz, Boris Spieker, “On the ?log rank?-conjecture in communication complexity”, Combinatorica, 15, no. 4, 1995, 567
![https://doi.org/10.1007/BF01192528 crossref](/refsvg/svg/crossref.svg)
- Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen, 10402, Advances in Cryptology – CRYPTO 2017, 2017, 3
![https://doi.org/10.1007/978-3-319-63715-0_1 crossref](/refsvg/svg/crossref.svg)
- Troy Lee, Adi Shraibman, “Around the log-rank conjecture”, Isr. J. Math., 256, no. 2, 2023, 441
![https://doi.org/10.1007/s11856-023-2517-5 crossref](/refsvg/svg/crossref.svg)
- R. Raz, B. Spieker, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 1993, 168
![https://doi.org/10.1109/SFCS.1993.366870 crossref](/refsvg/svg/crossref.svg)
- Ishay Haviv, Michal Parnas, “On the binary and Boolean rank of regular matrices”, Journal of Computer and System Sciences, 134, 2023, 73
![https://doi.org/10.1016/j.jcss.2023.01.005 crossref](/refsvg/svg/crossref.svg)