Construct · 1 fields · 1 citations

BLR linearity test: 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.

Graph algorithms

a three-query test that checks whether a Boolean function is close to linear by testing f(x) + f(y) = f(x + y) on random inputs.

In graph algorithms, BLR linearity test refers to a three-query test that checks whether a Boolean function is close to linear by testing f(x) + f(y) = f(x + y) on random inputs. This meaning comes from Blum (1993) 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 BLR linearity test 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

function5 fields · 6 citationsjingle · one word, five constructs

References

Blum, M., Luby, M., & Rubinfeld, R. (1993). Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47(3), 549-595. https://doi.org/10.1016/0022-0000(93)90044-w

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