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
FY 2015-16
Summary
In a constraint satisfaction problem (CSP), one must assign
values to variables that must satisfy various constraints; typical
real world examples include scheduling problems, database queries,
image-processing, and frequency assignment problems. In general,
determining whether a CSP admits a solution is an algorithmic
challenge, but it often happens in practice that the constraints
are of a very restricted form, allowing the use of efficient
methods to solve the CSP. Our long-term goal is to classify
precisely what kinds of restrictions lead to these tractable
CSP's. Our approach is based on an unexpected and fruitful
connection between CSP's and universal algebra that was uncovered
in the late 90's by P. Jeavons. In short, every family of
constraints is transformed into a mathematical object whose
algebraic properties somehow reflect the difficulty of solving the
CSP. This algebraic approach has led to some major breakthroughs
in the last 10 years in the study of the algorithmic complexity of
constraint satisfaction problems.
Program
Discovery Grants Program - Individual
Recipient
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
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
2015
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
5
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 assign
values to variables that must satisfy various constraints; typical
real world examples include scheduling problems, database queries,
image-processing, and frequency assignment problems. In general,
determining whether a CSP admits a solution is an algorithmic
challenge, but it often happens in practice that the constraints
are of a very restricted form, allowing the use of efficient
methods to solve the CSP. Our long-term goal is to classify
precisely what kinds of restrictions lead to these tractable
CSP's. Our approach is based on an unexpected and fruitful
connection between CSP's and universal algebra that was uncovered
in the late 90's by P. Jeavons. In short, every family of
constraints is transformed into a mathematical object whose
algebraic properties somehow reflect the difficulty of solving the
CSP. This algebraic approach has led to some major breakthroughs
in the last 10 years in the study of the algorithmic complexity of
constraint satisfaction problems.