Math 2.0

Areas Theory of computation Topic

Pseudorandomness and derandomization

Summary

This topic is a part of theory of computation. It covers objects that look random to restricted observers, such as generators, extractors, expanders and small-bias spaces, and their use to remove randomness from algorithms and to convert hardness into randomness.

About this page
TagQ6Y3KPGJ0V
URIm2://Q6Y3KPGJ0V
Kindtopic
WritingW0 stub
MSC68Q10, 68Q87, 05C48
Part ofTheory of computation
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.