The Complexity of Counting and Randomised Approximation
(2003)
Thesis
Bordewich, M. (2003). The Complexity of Counting and Randomised Approximation. (Thesis). Department of Mathematics, New College, Oxford University. Retrieved from https://durham-repository.worktribe.com/output/1642207
Research Repository