Strong NP-completeness of a matrix similarity problem

Author： Brimkov V. Codenotti B. Leoncini M. Resta G.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.165, Iss.2, 1996-10, pp. : 483-490

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

NP-completeness of the energy barrier problem without pseudoknots and temporary arcs

By Maňuch Ján

Natural Computing, Vol. 10, Iss. 1, 2011-03 ,pp. : 391-405

Springer Publishing Company

Access to resources Recommend Favorite

Max NP-completeness made easy

By Crescenzi P. Trevisan L.

Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. : 65-79

Elsevier

Access to resources Recommend Favorite

The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness

By Creignou N.

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 111-145

Elsevier

Access to resources Recommend Favorite

NP-completeness for calculating power indices of weighted majority games

By Matsui Y. Matsui T.

Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. : 305-310

Elsevier

Access to resources Recommend Favorite

Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

By Chrobak

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 81-98

Elsevier

Access to resources Recommend Favorite