Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Waterloo

$15,000.00

Research in complexity of algorithms

FY 2006-07

Summary
The basic theory of computation measures efficiency, or complexity, against the size of the problem instance to be solved.  Often, however, the amount of input data does not predict the true difficulty of a particular instance. By way of analogy, although a larger crossword puzzle (for example) will tend to require more time than a small one, solving an easy large puzzle may require less time than solving a hard small one. Many computational problems have the aspect that problems which appear large and daunting may actually be simple and solvable.  Examples of such problems occur frequently in communications, transportation, manufacturing, retailing, drug design, and many other areas.  In order to investigate this phenomenon, researchers have developed the concept of "fixed-parameter" complexity, in which a recognizable feature of a problem (the "parameter") is used as a measure of how hard the given instance actually is.  For some problems, instances having a small parameter admit of a quickly-obtained, optimal solution.  In other cases, however, even instances having a small parameter remain insoluble in practice. The proposed research will investigate the hard cases, in order to identify and characterize what makes a problem "fixed-parameter intractable".  Understanding these characteriztics may lead to discovery of new techniques so that apparently hard problems become actually easy.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
9171-2006
Name nom
Buss, Jonathan
Department département
Computer Science, School of
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2006
Competition year année de concours
2006
Award amount
15000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2712
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Theory of computation
Research subject fr
Théorie de calcul
Partie
1
Nb partie
5
Application title
Research in complexity of algorithms
Keyword
NA
Application summary
The basic theory of computation measures efficiency, or complexity, against the size of the problem instance to be solved.  Often, however, the amount of input data does not predict the true difficulty of a particular instance. By way of analogy, although a larger crossword puzzle (for example) will tend to require more time than a small one, solving an easy large puzzle may require less time than solving a hard small one. Many computational problems have the aspect that problems which appear large and daunting may actually be simple and solvable.  Examples of such problems occur frequently in communications, transportation, manufacturing, retailing, drug design, and many other areas.  In order to investigate this phenomenon, researchers have developed the concept of "fixed-parameter" complexity, in which a recognizable feature of a problem (the "parameter") is used as a measure of how hard the given instance actually is.  For some problems, instances having a small parameter admit of a quickly-obtained, optimal solution.  In other cases, however, even instances having a small parameter remain insoluble in practice. The proposed research will investigate the hard cases, in order to identify and characterize what makes a problem "fixed-parameter intractable".  Understanding these characteriztics may lead to discovery of new techniques so that apparently hard problems become actually easy.