Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.287, Iss.2, 2002-09, pp. : 473-499
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
Approximation of some NP-hard optimization problems by finite machines, in probability
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
Access to resources
Recommend
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. :
The word problem for 1LC congruences is NP-hard
By Rosaz L.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
The inapproximability of non-NP-hard optimization problems
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :