Retrieving "Laszlo Lovasz" from the archives

Cross-reference notes under review

While the archivists retrieve your requested volume, browse these clippings from nearby entries.

1. Randomized Algorithms

   Linked via "László Lovász"

   Derandomization seeks to replace the source of true randomness with a deterministic sequence that mimics the statistical properties of true random bits, known as a pseudorandom sequence. The construction of good pseudorandom number generators (PRNGs) is crucial here.
   A key tool in complexity theory related to this is the use of pseudorandom sets or pairwise independent hashing. The results of László Lovász and later generalizations established that for many applications where only low-degree independence is required…