Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems

ISSN： 0178-4617

Source： Algorithmica, Vol.62, Iss.3-4, 2012-04, pp. : 659-700

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

Related content

Lower Bounds on the Multiparty Communication Complexity

By Duris P. Rolim J.D.P.

Journal of Computer and System Sciences, Vol. 56, Iss. 1, 1998-02 ,pp. : 90-95

Academic Press

Access to resources Recommend Favorite

Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems

By Sen S.

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 59-78

Elsevier

Access to resources Recommend Favorite

Stability in the Combinatorial Vector Optimization Problems

By Emelichev V. A. Kuz'min K. G. Leonovich A. M.

Automation and Remote Control, Vol. 65, Iss. 2, 2004-02 ,pp. : 227-240

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Lower bounds for one-way probabilistic communication complexity and their application to space complexity

By Ablayev F.

Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. : 139-159

Elsevier

Access to resources Recommend Favorite

Which Problems Have Strongly Exponential Complexity?

By Impagliazzo R. Paturi R. Zane F.

Journal of Computer and System Sciences, Vol. 63, Iss. 4, 2001-12 ,pp. : 512-530

Academic Press

Access to resources Recommend Favorite