Federation Fellowships - Grant ID: FF0455774

Funding Activity

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

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

Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is relevant to public-key cryptography, where breaking an encryption scheme should be infeasible, and to many real-life situations where NP-complete problems need to be solved, either exactly or approximately.

Funded Activity Details

Start Date: 14-03-2005

End Date: 13-03-2010

Funding Scheme: Federation Fellowships

Funding Amount: $1,519,710.00

Funder: Australian Research Council

Research Topics

ANZSRC Field of Research (FoR)

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

ANZSRC Socio-Economic Objective (SEO)

Computer software and services not elsewhere classified | Mathematical sciences |

Other Keywords

Analysis Of Algorithms And Complexity | Computation Theory and Mathematics | Computer software and services not elsewhere classified | Data Encryption | Data Security | Mathematical sciences

Related Links