Author:
Shigeta Manami,Amano Kazuyuki
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference15 articles.
1. Neighborly families of boxes and bipartite coverings;Alon;Algorithms Combin.,1997
2. Some improved bounds on communication complexity via new decomposition of cliques;Amano;Discrete Appl. Math.,2014
3. Clique versus independent set;Bousquet;European J. Combin.,2014
4. A comparison of two lower-bound methods for communication complexity;Dietzfelbinger;Theoret. Comput. Sci.,1996
5. M. Friesen, A. Hamed, T. Lee, D.O. Theis, Fooling sets and rank, arXiv:1208.2920, 2012.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Unambiguous DNFs and Alon–Saks–Seymour;SIAM Journal on Computing;2023-10-20
2. Finding biclique partitions of co-chordal graphs;Discrete Applied Mathematics;2023-10
3. Around the log-rank conjecture;Israel Journal of Mathematics;2023-09
4. On the binary and Boolean rank of regular matrices;Journal of Computer and System Sciences;2023-06
5. Unambiguous DNFs and Alon-Saks-Seymour;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02