Author: Ausiello G. Crescenzi P. Protasi M.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.150, Iss.1, 1995-10, pp. : 1-55
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 inapproximability of non-NP-hard optimization problems
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Approximation of some NP-hard optimization problems by finite machines, in probability
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
Structural properties of bounded relations with an application to NP optimization problems
By Merkle W.
Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. :