Unimodality, Independence Lead to NP-Hardness of Interval Probability Problems

ISSN： 1385-3139

Source： Reliable Computing, Vol.13, Iss.3, 2007-06, pp. : 261-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

Strong NP-hardness of scheduling problems with learning or aging effect

By Janiak Adam

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 577-583

Springer Publishing Company

Access to resources Recommend Favorite

NP-hardness of Euclidean sum-of-squares clustering

By Aloise Daniel

Machine Learning, Vol. 75, Iss. 2, 2009-05 ,pp. : 245-248

Springer Publishing Company

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

NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow: Special Issue on Scheduling

By Erlebach Thomas Hall Alexander

Journal of Scheduling, Vol. 7, Iss. 3, 2004-05 ,pp. : 223-241

Springer Publishing Company

Access to resources Recommend Favorite

Complete problems for monotone NP

By Stewart I.A.

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

Elsevier

Access to resources Recommend Favorite