The synthesis problem for elementary net systems is NP-complete

Author： Badouel E. Bernadinello L. Darondeau P.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.186, Iss.1, 1997-10, pp. : 107-134

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Ontology Mapping Validation: Dealing with an NP-Complete Problem

International Journal of Web Portals (IJWP), Vol. 3, Iss. 3, 2011-07 ,pp. : 1-11

IGI Global_journal

Access to resources Recommend Favorite

A Random NP-complete problem for inversion of 2D cellular automata

By Durand B.

Theoretical Computer Science, Vol. 148, Iss. 1, 1995-08 ,pp. : 19-32

Elsevier

Access to resources Recommend Favorite

The Sturm-Liouville Eigenvalue Problem and NP-Complete Problems in the Quantum Setting with Queries

By Papageorgiou A. Woźniakowski H.

Quantum Information Processing, Vol. 6, Iss. 2, 2007-04 ,pp. : 101-120

Springer Publishing Company

Access to resources Recommend Favorite

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. : 471-476

Elsevier

Access to resources Recommend Favorite

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. : 39-48

Elsevier

Access to resources Recommend Favorite