A comparison of two lower bound methods for communication complexity Export

@incollection{citeulike:3890173, abstract = {The methods ” Rank” and ” Fooling Set” for proving lower bounds on the deterministic communication complexity of Boolean functions are compared. The main results are as follows.}, author = {Dietzfelbinger, Martin and Hromkovi\v{c}, Juraj and Schnitger, Georg}, citeulike-article-id = {3890173}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-58338-6_79}, citeulike-linkout-1 = {http://www.springerlink.com/content/p22121456q8h27u1}, doi = {10.1007/3-540-58338-6_79}, journal = {Mathematical Foundations of Computer Science 1994}, keywords = {complexity, distributed}, pages = {326--335}, posted-at = {2009-01-16 05:36:19}, priority = {2}, title = {A comparison of two lower bound methods for communication complexity}, url = {http://dx.doi.org/10.1007/3-540-58338-6_79}, year = {1994} }

TY - CHAP ID - citeulike:3890173 L3 - citeulike-article-id:3890173 N2 - The methods “Rank” and “Fooling Set” for proving lower bounds on the deterministic communication complexity of Boolean functions are compared. The main results are as follows. JF - Mathematical Foundations of Computer Science 1994 EP - 335 TI - A comparison of two lower bound methods for communication complexity SP - 326 KW - complexity KW - distributed AU - Dietzfelbinger, Martin AU - Hromkovič, Juraj AU - Schnitger, Georg PY - 1994/// UR - http://dx.doi.org/10.1007/3-540-58338-6_79 ER -