Grant: Discovery Grants Program - Individual
Concordia University
$20,000.00
Applications of algebra to the study of fine-grained computational complexity of constraint satisfaction problems
EF 2014-15
Résumé
In a constraint satisfaction problem (CSP), one must assignvalues to variables that must satisfy various constraints; typicalreal world examples include scheduling problems, database queries,image-processing, and frequency assignment problems. In general,determining whether a CSP admits a solution is an algorithmicchallenge, but it often happens in practice that the constraintsare of a very restricted form, allowing the use of efficientmethods to solve the CSP. Our long-term goal is to classifyprecisely what kinds of restrictions lead to these tractableCSP's. Our approach is based on an unexpected and fruitfulconnection between CSP's and universal algebra that was uncoveredin the late 90's by P. Jeavons. In short, every family ofconstraints is transformed into a mathematical object whosealgebraic properties somehow reflect the difficulty of solving theCSP. This algebraic approach has led to some major breakthroughsin the last 10 years in the study of the algorithmic complexity ofconstraint satisfaction problems.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
238899-2011
Name nom
Larose, Benoît
Department département
Mathematics and Statistics
Organization id
70
Institution établissement
Concordia University
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2011
Award amount
20000
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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
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
2703
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Complexity
Research subject fr
Complexité
Partie
4
Nb partie
5
Application title
Applications of algebra to the study of fine-grained computational complexity of constraint satisfaction problems
Keyword
NSERC
Application summary
In a constraint satisfaction problem (CSP), one must assignvalues to variables that must satisfy various constraints; typicalreal world examples include scheduling problems, database queries,image-processing, and frequency assignment problems. In general,determining whether a CSP admits a solution is an algorithmicchallenge, but it often happens in practice that the constraintsare of a very restricted form, allowing the use of efficientmethods to solve the CSP. Our long-term goal is to classifyprecisely what kinds of restrictions lead to these tractableCSP's. Our approach is based on an unexpected and fruitfulconnection between CSP's and universal algebra that was uncoveredin the late 90's by P. Jeavons. In short, every family ofconstraints is transformed into a mathematical object whosealgebraic properties somehow reflect the difficulty of solving theCSP. This algebraic approach has led to some major breakthroughsin the last 10 years in the study of the algorithmic complexity ofconstraint satisfaction problems.