BPP and the polynomial hierarchy (Q1052094)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	BPP and the polynomial hierarchy	scientific article

Statements

scholarly article

0 references

BPP and the polynomial hierarchy (English)

0 references

Clemens Lautemann

0 references

Information Processing Letters

0 references

publication date

1983

0 references

zbMATH Keywords

complexity

0 references

probabilistic Turing machines

0 references

polynomial hierarchy

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0020-0190(83)90044-3

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

Computational Complexity of Probabilistic Turing Machines

0 references

Some observations on the probabilistic algorithms and NP-hard problems

0 references

The polynomial-time hierarchy

0 references

Randomised algorithms

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0020-0190(83)90044-3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1052094

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