COMPLEX NETWORKS: DYNAMICS, OPTIMIZATION AND CONTROL. Complex networks such large power grids, the Internet, transportation networks and co-operation networks of all kinds provide challenges for frontier technologies particularly computing, communication and control. In particular, advanced societies have become dependent on large infrastructure networks to an extent beyond our capability to plan and control them. The recent spate of collapses in power grids and virus attacks on the Internet i ....COMPLEX NETWORKS: DYNAMICS, OPTIMIZATION AND CONTROL. Complex networks such large power grids, the Internet, transportation networks and co-operation networks of all kinds provide challenges for frontier technologies particularly computing, communication and control. In particular, advanced societies have become dependent on large infrastructure networks to an extent beyond our capability to plan and control them. The recent spate of collapses in power grids and virus attacks on the Internet illustrate the need for research on modelling, analysis of behaviour, planning and control in such networks. This project aims to establish research in this area for Australia's benefit.Read moreRead less
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 ....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.Read moreRead less