ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS
type: Item
instance of: scholarly article
title: ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS
zbMATH Open document ID: 0746.68037
DOI: 10.1142/S0129054191000133
author: Zhi-Zhong Chen
author: Seinosuke Toda
published in: International Journal of Foundations of Computer Science
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 59907
zbMATH Keywords: polynomial paddability
zbMATH Keywords: truth-table reducibility
zbMATH Keywords: randomized algorithm
zbMATH Keywords: non-deterministic polynomial time
zbMATH Keywords: computational complexity theory
MaRDI profile type: Publication
full work available at URL: s0129054191000133
OpenAlex ID: W1985204981
description: scientific article