Construct · 1 fields · 1 citations

Sipser-Lautemann theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the result that bounded-error probabilistic polynomial time lies within the second level of the polynomial hierarchy.

In computational complexity, Sipser-Lautemann theorem refers to the result that bounded-error probabilistic polynomial time lies within the second level of the polynomial hierarchy. This meaning comes from Lautemann (1983) in Information Processing Letters.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Sipser-Lautemann theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructs hierarchy4 fields · 4 citationsjingle · one word, four constructs information4 fields · 5 citationsjingle · one word, four constructs

References

Lautemann, C. (1983). BPP and the polynomial hierarchy. Information Processing Letters, 17(4), 215-217. https://doi.org/10.1016/0020-0190(83)90044-3

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct