Geodesic
Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem
Discrete mathematics & theoretical computer science, Tome 13 (2011) no. 4.

Voir la notice de l'article provenant de la source Episciences

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity 
@article{DMTCS_2011_13_4_a5,
     author = {Hayes, Thomas P.},
     title = {Separating the k-party communication complexity hierarchy: an application of the {Zarankiewicz} problem},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {13},
     number = {4},
     year = {2011},
     doi = {10.46298/dmtcs.546},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.546/}
}
TY  - JOUR
AU  - Hayes, Thomas P.
TI  - Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem
JO  - Discrete mathematics & theoretical computer science
PY  - 2011
VL  - 13
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.546/
DO  - 10.46298/dmtcs.546
LA  - en
ID  - DMTCS_2011_13_4_a5
ER  - 
%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
Hayes, Thomas P. Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem. Discrete mathematics & theoretical computer science, Tome 13 (2011) no. 4. doi : 10.46298/dmtcs.546. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.546/

Cité par Sources :