Lower Bounds on the Multiparty Communication Complexity

By Duris P.   Rolim J.D.P.  

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

Academic Press

Access to resources Recommend Favorite

A nonlinear lower bound on the practical combinational complexity

By Gubas X.   Hromkovic J.   Waczulik J.  

Theoretical Computer Science, Vol. 143, Iss. 2, 1995-06 ,pp. : 335-342

Elsevier

Access to resources Recommend Favorite

On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

By Kolpakov R.   Posypkin M.   Sigal I.  

Automation and Remote Control, Vol. 71, Iss. 10, 2010-10 ,pp. : 2152-2161

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

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

Lower Bound Methods and Separation Results for On-Line Learning Models

By Maass W.  

Machine Learning, Vol. 9, Iss. 2-3, 1992-07 ,pp. : 107-145

Springer Publishing Company

Access to resources Recommend Favorite