Author： Fontes Dalila Hadjiconstantinou Eleni Christofides Nicos
Publisher： Springer Publishing Company
ISSN： 0925-5001
Source： Journal of Global Optimization, Vol.34, Iss.1, 2006-01, pp. : 97-125
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
New lower bounds on the cost of binary search trees
Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. :
Lower bounds for wide-sense nonblocking Clos network
By Tsai K.-H. Wang D.-W. Hwang F.
Theoretical Computer Science, Vol. 261, Iss. 2, 2001-06 ,pp. :
Lower bounds for some decision problems over C
By Malajovich
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :