The NOF Multiparty Communication Complexity of Composed Functions

We study the k -party “number on the forehead” communication complexity of composed functions f ∘ g → , where f : { 0 , 1 } n → { ± 1 } , g → = ( g 1 , … , g n ) , g i : { 0 , 1 } k → { 0 , 1 } and for ( x 1 , … , x k ) ∈ ( { 0 , 1 } n ) k , f ∘ g → ( x 1 , … , x k ) = f ( … , g i ( x 1 , i , … , x...

Full description

Bibliographic Details

Published in:	Computational complexity Vol. 24; no. 3; pp. 645 - 694
Main Authors:	Ada, Anil, Chattopadhyay, Arkadev, Fawzi, Omar, Nguyen, Phuong
Format:	Journal Article
Language:	English
Published:	Basel Springer Basel 01.09.2015
Subjects:	Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis Computer Science Number on the forehead model Ramsey theory 05D10 communication complexity 68Q17 68Q05
ISSN:	1016-3328, 1420-8954
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!