Martin's game: a lower bound for the number of sets

Author： Ageev M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 871-876

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 new lower bound for the bipartite crossing number with applications

By Shahrokhi F.   Sykora O.   Szekely L.A.   Vrt'o I.  

Theoretical Computer Science, Vol. 245, Iss. 2, 2000-08 ,pp. : 281-294

Elsevier

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

Number of models and satisfiability of sets of clauses

By Wenhui Z.  

Theoretical Computer Science, Vol. 155, Iss. 1, 1996-02 ,pp. : 277-288

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

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