Professor Magnus Bordewich m.j.r.bordewich@durham.ac.uk
Professor
The Complexity of Counting and Randomised Approximation
Bordewich, M.
Authors
Citation
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
| Thesis Type | Thesis |
|---|---|
| Public URL | https://durham-repository.worktribe.com/output/1642207 |
| Award Date | 2003 |
You might also like
Quantifying the difference between phylogenetic diversity and diversity indices
(2024)
Journal Article
On the Complexity of Optimising Variants of Phylogenetic Diversity on Phylogenetic Networks
(2022)
Journal Article
On the Maximum Agreement Subtree Conjecture for Balanced Trees
(2022)
Journal Article
A universal tree-based network with the minimum number of reticulations
(2018)
Journal Article
Recovering normal networks from shortest inter-taxa distance information
(2018)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search