A nonlinear lower bound on the practical combinational complexity

Author： Gubas X. Hromkovic J. Waczulik J.

Publisher： Elsevier

ISSN： 0304-3975

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

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

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

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 bound for scalable Byzantine Agreement

By Holtby Dan

Distributed Computing, Vol. 21, Iss. 4, 2008-10 ,pp. : 239-248

Springer Publishing Company

Access to resources Recommend Favorite

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

Complexity and algorithms for nonlinear optimization problems

By Hochbaum Dorit

Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,pp. : 257-296

Springer Publishing Company

Access to resources Recommend Favorite