Probabilistic polynomial time is closed under parity reductions
type: Item
instance of: scholarly article
title: Probabilistic polynomial time is closed under parity reductions
zbMATH Open document ID: 0714.68031
DOI: 10.1016/0020-0190(91)90140-D
author: Richard Beigel
author: Gerd Wechsung
author: Lane A. Hemaspaandra
published in: Information Processing Letters
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 4176443
zbMATH Keywords: computational complexity
zbMATH Keywords: probabilistic polynomial time
MaRDI profile type: Publication
cites work: Q3692867
cites work: Bounded queries to SAT and the Boolean hierarchy
cites work: On the power of parity polynomial time
cites work: Computational Complexity of Probabilistic Turing Machines
cites work: Q3779736
cites work: The strong exponential hierarchy collapses
cites work: The difference and truth-table hierarchies for NP
cites work: The complexity of optimization problems
cites work: The complexity of facets (and some facets of complexity)
cites work: The complexity of combinatorial problems with succinct input representation
description: scientific article; zbMATH DE number 4176443