Publisher： IGI Global_journal
E-ISSN： 1938-0208|3|3|1-11
ISSN： 1938-0194
Source： International Journal of Web Portals (IJWP), Vol.3, Iss.3, 2011-07, pp. : 1-11
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 synthesis problem for elementary net systems is NP-complete
By Badouel E. Bernadinello L. Darondeau P.
Theoretical Computer Science, Vol. 186, Iss. 1, 1997-10 ,pp. :
Access to resources
Recommend
A Random NP-complete problem for inversion of 2D cellular automata
By Durand B.
Theoretical Computer Science, Vol. 148, Iss. 1, 1995-08 ,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. :
Topology of strings: Median string is NP-complete
By de la Higuera C. Casacuberta F.
Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. :