On random oracle separations (Q1182108)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On random oracle separations	scientific article

Statements

scholarly article

0 references

On random oracle separations (English)

0 references

0 references

Information Processing Letters

0 references

publication date

27 June 1992

0 references

zbMATH Keywords

relativizations of complexity classes

0 references

random oracles

0 references

uniform witness

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1

0 references

Characterizing polynomial complexity classes by reducibilities

0 references

With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy

0 references

Structural complexity theory: Recent surprises

0 references

On the random oracle hypothesis

0 references

Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?

0 references

full work available at URL

https://doi.org/10.1016/0020-0190(91)90054-l

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0020-0190(91)90054-L

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1182108

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1182108&oldid=37065119"