Randomness and pseudo-randomness in discrete mathematics

MaRDI QIDQ4208482zbMATH OpenFDO

Authors Noga Alon

Publication date 9 March 1999

zbMATH Keywords

derandomizationdeterministic algorithmsrandom structures

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)

Review text

A survey is given of two expanding areas of discrete mathematics: the use of probabilistic techniques for proving deterministic statements, and the use of randomized algorithms for finding efficient deterministic algorithms. For the entire collection see [Zbl 0893.00027].

Recommendations

• Randomness, computation and mathematics
• scientific article; zbMATH DE number 7377983
• Randomness and computation
• RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS
• Randomness and arithmetic
• Randomness, pseudorandomness and models of arithmetic
• Pseudorandomness in computer science and in additive combinatorics
• scientific article; zbMATH DE number 1487695
• Pseudorandomness and Combinatorial Constructions

Cited in

(6)

• Pseudo-randomness: objects and generation
• Inevitable randomness in discrete mathematics
• The determinism of randomness and its use in combinatorics
• Randomness, arrays, differences and duality
• Randomness, pseudorandomness and models of arithmetic
• Pseudorandomness and Combinatorial Constructions

This page was built for publication: Randomness and pseudo-randomness in discrete mathematics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4208482)