Atlas home || Conferences | Abstracts | about Atlas

1998 New Zealand Mathematics Colloquium
July 6-9, 1998
Victoria University of Wellington
Wellington, New Zealand

Organizers
Peter Donelan, Chris Atkin, John Harper, Philip Rhodes-Robinson, Jim Neyland, Geoff Whittle, Steve White, Vladimir Pestov, Tom Crosby

View Abstracts
Conference Homepage

Parameterized Complexity: Overview and Open Questions
by
Rod Downey
Victoria University of Wellington

Parameterized complexity is an attempt to try to understand the contribution of various aspects of a combinatorial problem to its overall complexity. We now see the area as a major paradigm towards the problem of paractically coping with theoretical intractability.

This talk will describe some of the key ideas in the area after 10 years and will look at some of the major open questions. It will be the same talk as I plan to give as the first talk in the SIAM minisymposium on parameterized complexity as part of the SIAM meeting on Discrete mathematics in Toronto.

The talk is intended to be relatively general.

Date received: June 23, 1998

Copyright © 1998 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cabd-62.