Hao Huang, Benny Sudakov, “A counterexample to the Alon-Saks-Seymour conjecture and related problems”, Combinatorica, 32, no. 2, 2012, 205
Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie, “On order and rank of graphs”, Combinatorica, 35, no. 6, 2015, 655
P. Pudlák, V. Rödl, “Some combinatorial-algebraic problems from complexity theory”, Discrete Mathematics, 136, no. 1-3, 1994, 253
N. Nisan, A. Wigderson, Proceedings 35th Annual Symposium on Foundations of Computer Science, 1994, 831
Panos M. Pardalos, Thelma Mavridou, Jue Xue, Handbook of Combinatorial Optimization, 1998, 1077
Ran Raz, Boris Spieker, “On the ?log rank?-conjecture in communication complexity”, Combinatorica, 15, no. 4, 1995, 567
Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen, 10402, Advances in Cryptology – CRYPTO 2017, 2017, 3
Troy Lee, Adi Shraibman, “Around the log-rank conjecture”, Isr. J. Math., 256, no. 2, 2023, 441
R. Raz, B. Spieker, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 1993, 168
Ishay Haviv, Michal Parnas, “On the binary and Boolean rank of regular matrices”, Journal of Computer and System Sciences, 134, 2023, 73