Construct · 1 fields · 1 citations

Barrington's 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 width-5 branching programs of polynomial size compute exactly the languages in NC1.

In computational complexity, Barrington's theorem refers to the result that width-5 branching programs of polynomial size compute exactly the languages in NC1. This meaning comes from Barrington (1989) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

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

See how Barrington's 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

branching3 fields · 4 citationsjingle · one word, three constructs complexity4 fields · 7 citationsjingle · one word, four constructs size1 fields · 1 citationsanchor · a standalone construct

References

Barrington, D. A. (1989). Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. Journal of Computer and System Sciences, 38(1), 150-164. https://doi.org/10.1016/0022-0000(89)90037-8

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