Lower Bounds on the Multiparty Communication Complexity

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.56, Iss.1, 1998-02, pp. : 90-95

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Lower bounds for one-way probabilistic communication complexity and their application to space complexity

By Ablayev F.

Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. : 139-159

Elsevier

Access to resources Recommend Favorite

Complexity lower bounds for computation trees with elementary transcendental function gates

By Grigoriev D. Vorobjov N.

Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. : 185-214

Elsevier

Access to resources Recommend Favorite

Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems

By Bompadre Agustín

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 659-700

Springer Publishing Company

Access to resources Recommend Favorite

Sample size lower bounds in PAC learning by Algorithmic Complexity Theory

By Apolloni B. Gentile C.

Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. : 141-162

Elsevier

Access to resources Recommend Favorite

A comparison of two lower-bound methods for communication complexity

By Dietzfelbinger M. Hromkovic J. Schnitger G.

Theoretical Computer Science, Vol. 168, Iss. 1, 1996-11 ,pp. : 39-51

Elsevier

Access to resources Recommend Favorite