Uses of randomness in computation
Random number generators are widely used in practical algorithms. Examples include simulation, number theory (primality testing and integer factorization), fault tolerance, routing, cryptography, optimization by simulated annealing, and perfect hashing. Complexity theory usually considers the worst-case behaviour of deterministic algorithms, but it can also consider average-case behaviour if it is assumed that the input data is drawn randomly from a given distribution. Rabin popularised the...[Show more]
|Collections||ANU Research Publications|
|1622-01.2003-07-09T01:22:44Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-94-06.pdf||221.47 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.