Generalizations of Opt P to the polynomial hierarchy
type: Item
instance of: scholarly article
title: Generalizations of Opt P to the polynomial hierarchy
zbMATH Open document ID: 0769.68031
DOI: 10.1016/0304-3975(92)90073-O
author: Mark W. Krentel
published in: Theoretical Computer Science
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 65306
zbMATH Keywords: Opt P
zbMATH Keywords: polynomial hierarchy
zbMATH Keywords: Turing machines
zbMATH Keywords: polynomial space
MaRDI profile type: Publication
cites work: Alternation
cites work: Q4198056
cites work: Q4249726
cites work: How easy is local search?
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: The complexity of optimization problems
cites work: Games against nature
cites work: The complexity of facets (and some facets of complexity)
cites work: On the complexity of some two-person perfect-information games
cites work: Simple Local Search Problems that are Hard to Solve
cites work: The polynomial-time hierarchy
cites work: Q4131648
cites work: The complexity of computing the permanent
cites work: NP is as easy as detecting unique solutions
cites work: The complexity of combinatorial problems with succinct input representation
cites work: Q3795231
description: scientific article; zbMATH DE number 65306