Ordered biclique partitions and communication complexity problems
暂无分享,去创建一个
[1] Martin Dietzfelbinger,et al. A Comparison of Two Lower Bound Methods for Communication Complexity , 1994, MFCS.
[2] M. Yannakakis. Expressing combinatorial optimization problems by linear programs , 1991, Symposium on the Theory of Computing.
[3] Nicolas Bousquet,et al. Clique versus independent set , 2013, Eur. J. Comb..
[4] Troy Lee,et al. Rank and fooling set size , 2013, ArXiv.
[5] Kazuyuki Amano,et al. Some improved bounds on communication complexity via new decomposition of cliques , 2014, Discret. Appl. Math..
[6] Noga Alon,et al. Neighborly Families of Boxes and Bipartite Coverings , 2013, The Mathematics of Paul Erdős II.
[7] Dirk Oliver Theis. Subdividing the polar of a face , 2007 .
[8] Stéphan Thomassé,et al. Quasi-P versus P , 2012 .
[9] Eyal Kushilevitz,et al. On the complexity of communication complexity , 2009, STOC '09.
[10] E. Kushilevitz,et al. Communication Complexity: Basics , 1996 .
[11] Stasys Jukna,et al. On covering graphs by complete bipartite subgraphs , 2009, Discret. Math..
[12] R. Graham,et al. On embedding graphs in squashed cubes , 1972 .
[13] Hao Huang,et al. A counterexample to the Alon-Saks-Seymour conjecture and related problems , 2010, Comb..
[14] Dirk Oliver Theis,et al. Fooling sets (a.k.a. cross-free matchings) and rank in non-zero characteristic , 2012, ArXiv.
[15] Rafail Ostrovsky,et al. The Linear-Array Conjecture in Communication Complexity Is False , 1996, STOC '96.
[16] Troy Lee,et al. Fooling-sets and rank , 2015, Eur. J. Comb..