Author： Bodlaender H.L. Downey R.G. Fellows M.R. Wareham H.T.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.147, Iss.1, 1995-08, pp. : 31-54
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
The complexity of multiple sequence alignment with SP-score that is a metric
By Bonizzoni
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
Access to resources
Recommend
The Turing way to parameterized complexity
By Cesati M.
Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. :
The Parameterized Complexity of the Shared Center Problem
By Chen Zhi-Zhong Ma Wenji Wang Lusheng
Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. :
Parameterized circuit complexity and the W hierarchy
By Downey R.G. Fellows M.R. Regan K.W.
Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. :