Characterization and complexity of uniformly nonprimitive labeled 2-structures

Author： Engelfriet J. Harju T. Proskurowski A. Rozenberg G.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.154, Iss.2, 1996-02, pp. : 247-282

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

The Complexity of Bottleneck Labeled Graph Problems

By Hassin Refael Monnot Jérôme Segev Danny

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 245-262

Springer Publishing Company

Access to resources Recommend Favorite

Complexity of solution structures in nonlinear pricing

By Berg Kimmo

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 23-37

Springer Publishing Company

Access to resources Recommend Favorite

On the computational complexity of determining polyatomic structures by X-rays

By Gardner R.J. Gritzmann P. Prangenberg D.

Theoretical Computer Science, Vol. 233, Iss. 1, 2000-02 ,pp. : 91-106

Elsevier

Access to resources Recommend Favorite

Complexity cube for the characterization of complex production systems

By Windt K. Philipp T. Bose F.

International Journal of Computer Integrated Manufacturing, Vol. 21, Iss. 2, 2007-12 ,pp. : 195-200

Taylor & Francis Ltd

Access to resources Recommend Favorite

Subset construction complexity for homogeneous automata, position automata and ZPC-structures

By Champarnaud J.-M.

Theoretical Computer Science, Vol. 267, Iss. 1, 2001-09 ,pp. : 17-34

Elsevier

Access to resources Recommend Favorite