Computational complexity of the product partition problem

MaRDI QIDQ3161287zbMATH OpenFDO

Authors M. S. Barketav, M. Y. Kovalyov

Publication date 14 October 2010

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• On the nearest product of partitions
• On the complexity of some partition problems
• Reduction of the three-partition problem
• ``NP\(=\)P? and restricted partitions

Cited in

(6)

• Reduction of the three-partition problem
• On the orbits of the product of two permutations
• On the complexity of some partition problems
• ``NP\(=\)P? and restricted partitions
• On the nearest product of partitions
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation

This page was built for publication: Computational complexity of the product partition problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3161287)