![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.259, Iss.1, 2001-05, pp. : 323-339
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Faster exact solutions for some NP-hard problems
Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The inapproximability of non-NP-hard optimization problems
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Alignment and Distribution Is Not (Always) NP-Hard
By Boudet V. Rastello F. Robert Y.
Journal of Parallel and Distributed Computing, Vol. 61, Iss. 4, 2001-04 ,pp. :