An oracle separating \(\oplus P\) from \(PP^{PH}\)
type: Item
instance of: scholarly article
title: An oracle separating \(\oplus P\) from \(PP^{PH}\)
zbMATH Open document ID: 0714.68032
DOI: 10.1016/0020-0190(91)90035-G
author: Frederic Green
published in: Information Processing Letters
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 4176444
zbMATH Keywords: computational complexity
zbMATH Keywords: relativized complexity class
zbMATH Keywords: polynomial-time hierarchy
zbMATH Keywords: probabilistic polynomial time
zbMATH Keywords: threshld circuits
MaRDI profile type: Publication
cites work: Relativized counting classes: Relations among thresholds, parity, and mods
cites work: Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
cites work: With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
cites work: Parallel computation with threshold functions
cites work: The complexity of combinatorial problems with succinct input representation
description: scientific article; zbMATH DE number 4176444