Discovery Projects - Grant ID: DP150104108

Funding Activity

Website
http://dataportal.arc.gov.au/NCGP/Web/Grant/Grant/DP150104108

Funding Status
Active

Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the .

Funded Activity Summary

Tractable topological computing: Escaping the hardness trap. Computational topology is a young and energetic field that uses computers to solve complex geometric problems driven by pure mathematics, and with diverse applications in biology, signal processing and data mining. A major barrier is that many of these problems are thought to be fundamentally and intractably hard. This project aims to defy such barriers for typical real-world inputs by fusing geometric techniques with technologies from the field of parameterised complexity, creating powerful, practical solutions for these problems. It is expected to shed much-needed light on the vast and puzzling gap between theory and practice, and give researchers fast new software tools for large-scale experimentation and cutting-edge computer proofs.

Funded Activity Details

Start Date: 01-01-2015

End Date: 30-06-2023

Funding Scheme: Discovery Projects

Funding Amount: $355,100.00

Funder: Australian Research Council

Research Topics

ANZSRC Field of Research (FoR)

Analysis of Algorithms and Complexity | Pure Mathematics | Mathematical Software | Topology

ANZSRC Socio-Economic Objective (SEO)

Expanding Knowledge in the Information and Computing Sciences | Application Software Packages (excl. Computer Games) | Expanding Knowledge in the Mathematical Sciences |

Other Keywords

Analysis of Algorithms and Complexity | Application Software Packages (excl. Computer Games) | Expanding Knowledge in the Information and Computing Sciences | Expanding Knowledge in the Mathematical Sciences | Mathematical Software | Pure Mathematics | Topology

Related Links