Post date: 02 Jan 2007
This book evolves around the expected complexity of random variate generation algorithms. It sets up an idealized computational model, introduces the notion of uniformly bounded expected complexity, and studies bounds for computational complexity.
Post date: 02 Jan 2007
This book evolves around the expected complexity of random variate generation algorithms. It sets up an idealized computational model, introduces the notion of uniformly bounded expected complexity, and studies bounds for computational complexity.