Preface 1. Monte Carlo methods and Quasi-Monte Carlo methods 2. Lattice rules for numerical integration 3. Low-discrepancy point sets and sequences 4. Nets and (t,s)-sequences 5. Random numbers and pseudorandom numbers.Expand

A systematic theory of a class of point sets called (t, m, s)-nets and of a class of sequences called (t, s)-sequences is developed. On the basis of this theory, point sets and sequences in… Expand

Randomized algorithms (making random choices during their execution) play an important role in modern computer science, with applications ranging from combinatorial optimization and machine learning to communications networks and secure protocols.Expand

Abstract We generalize and improve earlier constructions of low-discrepancy sequences by Sobol', Faure, and the author, thus obtaining sequences in the s-dimensional unit cube with the smallest… Expand

The first part of this book presents an introduction to the theory of finite fields, with emphasis on those aspects that are relevant for applications, such as information theory, algebraic coding theory and cryptology.Expand

Mathematics encyclopedia. finite fields books on advanced galois theory mathoverflow. elementary theory encyclopedia of mathematics. pdf download finite fields encyclopedia of mathematics. finite… Expand