Discovery Projects - Grant ID: DP0773331

Funding Activity

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

Funding Status
Closed

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

Efficient Pre-Processing of Hard Problems: New Approaches, Basic Theory and Applications. Computers store even larger amounts of data about all aspects of human and industrial activity. However, they have not become significantly better at solving common problems in optimization and search. Traditional complexity theory indicates many of these problems require algorithms that are very unlikely to exist. The Parameterized Complexity approach allows us to obtain very efficient algorithms for a large variety of problems, but the machinery required was diverse and complicated. This research will organize the machinery into a new approach that systematically finds good algorithms by applying simplifications around a parameter of the domain of the problem. As a result, efficient algorithms are obtained for many diverse areas.

Funded Activity Details

Start Date: 01-01-2007

End Date: 31-12-2011

Funding Scheme: Discovery Projects

Funding Amount: $380,813.00

Funder: Australian Research Council

Research Topics

ANZSRC Field of Research (FoR)

Analysis Of Algorithms And Complexity | Data Security | Computation Theory and Mathematics | Discrete Mathematics

ANZSRC Socio-Economic Objective (SEO)

Information processing services | Application packages | Computer software and services not elsewhere classified |

Other Keywords

Analysis Of Algorithms And Complexity | Application packages | Computation Theory and Mathematics | Computer software and services not elsewhere classified | Data Security | Discrete Mathematics | Information processing services

Related Links