![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Papageorgiou A. Woźniakowski H.
Publisher: Springer Publishing Company
ISSN: 1570-0755
Source: Quantum Information Processing, Vol.6, Iss.2, 2007-04, pp. : 101-120
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
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. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
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. :