Author： Belanger J. Jie W.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.181, Iss.2, 1997-07, pp. : 229-245
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
Complete problems for monotone NP
By Stewart I.A.
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :
Access to resources
Recommend
Approximate solution of NP optimization problems
By Ausiello G. Crescenzi P. Protasi M.
Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. :
On universally easy classes for NP-complete problems
By Demaine E.D. Lopez-Ortiz A. Munro J.I.
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :
The inapproximability of non-NP-hard optimization problems
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Faster exact solutions for some NP-hard problems
Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. :