16 May 2011
Seminar: Models of complexity, high-performance computing and computational topology
To be held at RMIT University, 09 June 2011. Presented by Dr. Benjamin Burton.
For many algorithms, performance is measured by studying the worst-case time complexity. However, for some algorithms (the simplex method being a well-known example), pathological cases are known to exist but are rarely seen in the wild. In situations like this we seek more realistic ways of measuring performance: examples include average-case complexity, generic complexity and parameterised complexity. We introduce and illustrate these alternative models of complexity, and show how – in conjunction with comprehensive data obtained using high-performance computing -- they suggest that difficult topological problems are in practice much easier to solve than we might think.
|
Title: |
Models of complexity, high-performance computing and computational topology |
|---|---|
|
Person: |
|
|
Date: |
2011-06-09 |
|
Time: |
3.30 pm – 4.30 pm |
|
Location: |
Access Grid Room |
More information
For more information regarding this seminar, please contact the School of Mathematical and Geospatial Sciences on 9925 2283 or smgs@rmit.edu.au