A space lower bound for st-connectivity on node-named JAGs

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.237, Iss.1, 2000-04, pp. : 327-345

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

Approximating Node-Connectivity Augmentation Problems

By Nutov Zeev

Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. : 398-410

Springer Publishing Company

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

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

Application of lower bound direct method to engineering structures

By François Akoa Abdelkader Hachemi An Le Said Mouhtamid Tao Pham

Journal of Global Optimization, Vol. 37, Iss. 4, 2007-04 ,pp. : 609-630

Springer Publishing Company

Access to resources Recommend Favorite

A new lower bound for the open-shop problem

By Guéret C. Prins C.

Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. : 165-183

Springer Publishing Company

Access to resources Recommend Favorite