Alignment and Distribution Is Not (Always) NP-Hard

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.61, Iss.4, 2001-04, pp. : 501-519

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

Faster exact solutions for some NP-hard problems

By Drori L. Peleg D.

Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. : 473-499

Elsevier

Access to resources Recommend Favorite

The word problem for 1LC congruences is NP-hard

By Rosaz L.

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 245-268

Elsevier

Access to resources Recommend Favorite

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

By Charon I. Hudry O. Lobstein A.

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 2109-2120

Elsevier

Access to resources Recommend Favorite

Approximation of some NP-hard optimization problems by finite machines, in probability

By Hong D. Birget

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 323-339

Elsevier

Access to resources Recommend Favorite

Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents

By Nourani Y. Andresen B.

Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. : 51-68

Elsevier

Access to resources Recommend Favorite