%0 Journal Article
%A Hayes, Thomas P.
%T Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem
%J Discrete mathematics & theoretical computer science
%D 2011
%V 13
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.546/
%R 10.46298/dmtcs.546
%G en
%F DMTCS_2011_13_4_a5