Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Alberta

$34,000.00

Investigations into the nature of hard problems

FY 2006-07

Summary
Many optimization problems require a search over vast sets of possible solutions for the best solution. Examples range from the scheduling of crews to planning to solving combinatorial puzzles. These problems are frequently very difficult to solve because they involve what is called ``the combinatorial explosion''. Basically, this means that increasing the size of the problem a little bit, say from 100 units to 110, may cause a hugely disproportionate increase in the number of cases that have to be considered. My research attempts to understand the issues inherent in developing effective algorithms for problems of this type.  Even when the possibility of exponential blow-up lies within a problem, many large instances of the problem may be easy to solve in practice. Trying to understand what distinguishes the hard from the easy instances is one of the approaches to developing better algorithms.
Program
Discovery Grants Program - Individual
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
8053-2006
Name nom
Culberson, Joseph
Department département
Computing Science
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2006
Competition year année de concours
2006
Award amount
34000
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
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
1
Nb partie
5
Application title
Investigations into the nature of hard problems
Keyword
NA
Application summary
Many optimization problems require a search over vast sets of possible solutions for the best solution. Examples range from the scheduling of crews to planning to solving combinatorial puzzles. These problems are frequently very difficult to solve because they involve what is called ``the combinatorial explosion''. Basically, this means that increasing the size of the problem a little bit, say from 100 units to 110, may cause a hugely disproportionate increase in the number of cases that have to be considered. My research attempts to understand the issues inherent in developing effective algorithms for problems of this type.  Even when the possibility of exponential blow-up lies within a problem, many large instances of the problem may be easy to solve in practice. Trying to understand what distinguishes the hard from the easy instances is one of the approaches to developing better algorithms.