Author： Iwama K. Iwamoto C. Morshed M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.155, Iss.2, 1996-03, pp. : 411-424
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
Treewidth Lower Bounds with Brambles
By Bodlaender Hans Grigoriev Alexander Koster Arie
Algorithmica, Vol. 51, Iss. 1, 2008-05 ,pp. :
Access to resources
Recommend
Lower bounds for asynchronous consensus
Distributed Computing, Vol. 19, Iss. 2, 2006-10 ,pp. :
Do stronger definitions of randomness exist?
By Durand B. Kanovei V. Uspensky V.A. Vereshchagin N.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Strong Minimax Lower Bounds for Learning
By Antos A.
Machine Learning, Vol. 30, Iss. 1, 1998-01 ,pp. :
Lower Bounds on the Multiparty Communication Complexity
Journal of Computer and System Sciences, Vol. 56, Iss. 1, 1998-02 ,pp. :