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. : 471-476

Elsevier

Access to resources Recommend Favorite

Correlation Structure of Landscapes of NP-Complete Optimization Problems at Finite Temperatures

By Gehring Wolfgang   Salamon Peter   Whitney Roger E.   Sibani Paolo  

Open Systems and Information Dynamics, Vol. 11, Iss. 2, 2004-06 ,pp. : 177-184

Springer Publishing Company

Access to resources Recommend Favorite

The Sturm-Liouville Eigenvalue Problem and NP-Complete Problems in the Quantum Setting with Queries

By Papageorgiou A.   Woźniakowski H.  

Quantum Information Processing, Vol. 6, Iss. 2, 2007-04 ,pp. : 101-120

Springer Publishing Company

Access to resources Recommend Favorite

Approximate solution of NP optimization problems

By Ausiello G.   Crescenzi P.   Protasi M.  

Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. : 1-55

Elsevier

Access to resources Recommend Favorite

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. : 107-134

Elsevier

Access to resources Recommend Favorite