Construct · 1 fields · 1 citations

fully polynomial randomized approximation scheme: 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.

Randomized algorithms

a randomized algorithm that estimates a count within any relative error with high probability in time polynomial in input size and inverse error.

In randomized algorithms, fully polynomial randomized approximation scheme refers to a randomized algorithm that estimates a count within any relative error with high probability in time polynomial in input size and inverse error. This meaning comes from Karp (1989) in Journal of Algorithms.[1]

Unit
Recovery means
Measured by

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

See how fully polynomial randomized approximation scheme 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

count2 fields · 2 citationsjingle · one word, two constructs error4 fields · 8 citationsjingle · one word, four constructs size1 fields · 1 citationsanchor · a standalone construct

References

Karp, R. M., Luby, M., & Madras, N. (1989). Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms, 10(3), 429-448. https://doi.org/10.1016/0196-6774(89)90038-2

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