CoChat

Construction of extractors using pseudo-random generators (extended abstract)

Open access
Trevisan, Luca · 1999 · Proceedings of the thirty-first annual ACM symposium on Theory of Computing
Cited by 73

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

We introduce a new approach to construct extractors.Extractors are algorithms that transform a "weakly random" distribution into au almost uniform distribution.Explicit constructions of extractors have a variety of important applications, and tend to be very difficult to achieve.We demonstrate an unsuspected connection between extractors and pseudorandom generators.In fact, we show that every pseudorandom generator of a certain kind is an extractor.A pseudprandom generator construction due to Impagliazzo and Wigderson, once reinterpreted via our connection, is already an extractor that beats most known constructions and solves an important open question.We also show that, using the simpler Nisan-Wigderson generator and standard error-correcting codes, one can build even better extractors with the additional advantage that both the construction and the analysis are extremely simple and admit a short self-contained treatment.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/301250.301289

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 73

Metadata

Authors
Trevisan, L.
Venue
Proceedings of the thirty-first annual ACM symposium on Theory of Computing
Publisher
ACM
Published
1999-05
Pages
141-148
OpenAlex
W2073136473
Cited by
73
References
1
FWCI
9.79
Type
conference paper
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Construction of extractors using pseudo-random generators (extended abstract). https://app.cochat.ai/papers/10.1145/301250.301289
The paper
Trevisan, L. (1999). Construction of extractors using pseudo-random generators (extended abstract). Proceedings of the thirty-first annual ACM symposium on Theory of Computing. https://doi.org/10.1145/301250.301289

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.