Author： Gehring Wolfgang Salamon Peter Whitney Roger E. Sibani Paolo
Publisher： Springer Publishing Company
ISSN： 1230-1612
Source： Open Systems and Information Dynamics, Vol.11, Iss.2, 2004-06, pp. : 177-184
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
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. :
Access to resources
Recommend
Complete problems for monotone NP
By Stewart I.A.
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :
Approximation of some NP-hard optimization problems by finite machines, in probability
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :