Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Simon Fraser University

$60,000.00

Complexity of partition problems

EF 2013-14

Résumé
Constraint satisfaction problems model many problems in scheduling, logistics, databases, and artificial intelligence. It has been observed that when the constraint language (or the constraint 'template') is fixed, the problems seem to fall into only two categories - polynomial time solvable or NP-complete. On the other hand, it is known that (unless P=NP) there must exist problems which are not solvable in polynomial time, but which are not quite NP-complete. Whether or not there are such 'intermediate' constraint satisfaction problems (with a fixed template) has become a very important open problem in theoretical computer science, driving much research effort based on algebra, analysis, logic, and combinatorics. Graphs seem to have an important role to play. Our results in graph theory have motivated the original problem, as well as several subsequent developments. It now appears that they will continue to motivate the research efforts. In this proposal, we propose research in the complexity of certain variants of graph homomorphism problems which would have implications for (variants of) general constraint satisfaction problems. These include list homomorphism, minimum cost homomorphism, and matrix partition problems.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
5075-2009
Name nom
Hell, Pavol
Department département
Computing Science, School of
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2009
Award amount
60000
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
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
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
Complexity of partition problems
Keyword
NSERC
Application summary
Constraint satisfaction problems model many problems in scheduling, logistics, databases, and artificial intelligence. It has been observed that when the constraint language (or the constraint 'template') is fixed, the problems seem to fall into only two categories - polynomial time solvable or NP-complete. On the other hand, it is known that (unless P=NP) there must exist problems which are not solvable in polynomial time, but which are not quite NP-complete. Whether or not there are such 'intermediate' constraint satisfaction problems (with a fixed template) has become a very important open problem in theoretical computer science, driving much research effort based on algebra, analysis, logic, and combinatorics. Graphs seem to have an important role to play. Our results in graph theory have motivated the original problem, as well as several subsequent developments. It now appears that they will continue to motivate the research efforts. In this proposal, we propose research in the complexity of certain variants of graph homomorphism problems which would have implications for (variants of) general constraint satisfaction problems. These include list homomorphism, minimum cost homomorphism, and matrix partition problems.