Alignment and Distribution Is Not (Always) NP-Hard

By Boudet V.   Rastello F.   Robert Y.  

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

Academic Press

Access to resources Recommend Favorite

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

APPROXIMATING THE NONHOMOGENEOUS LOGNORMAL DIFFUSION PROCESS VIA POLYNOMIAL EXOGENOUS FACTORS

By Gutiérrez R.   Rico N.   Román P.   Romero D.   Serrano J. J.   Torres F.  

Cybernetics and Systems, Vol. 37, Iss. 4, 2006-07 ,pp. : 293-309

Taylor & Francis Ltd

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