ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS

DOI10.1142/S0129054191000133zbMath0746.68037OpenAlexW1985204981MaRDI QIDQ4007852

Zhi-Zhong Chen

Publication date: 27 September 1992

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054191000133

zbMATH Keywords

randomized algorithmtruth-table reducibilitycomputational complexity theorynon-deterministic polynomial timepolynomial paddability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (4)

Ancestors, descendants, and gardens of Eden in reaction systems ⋮ Structure of polynomial-time approximation ⋮ Preimage Problems for Reaction Systems ⋮ Unnamed Item

This page was built for publication: ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS