|
| Name: |
Professor A Krokhin |
| Organisation: |
Durham, University of |
| Department: |
Computer Science |
| Current EPSRC-Supported Research
Topics: |
|
Fundamentals of Computing
|
|
|
| Current EPSRC Support |
| EP/R034516/1 | The Complexity of Promise Constraint Satisfaction | (P) |
|
| Previous EPSRC Support |
| EP/J000078/1 | Robustly Tractable Constraint Satisfaction Problems | (P) |
| EP/H000666/1 | Submodular optimization, lattice theory and maximum constraint satisfaction problems | (P) |
| EP/G011001/1 | Descriptive Complexity of Constraints: An Algebraic Approach | (P) |
| EP/D036720/1 | International Workshop on Mathematics of Constraint Satisfaction: Algebra, Logic, and Graph Theory | (P) |
| EP/C54384X/1 | Combining Approaches in Classifying Complexity of Constraints | (P) |
| EP/C543831/1 | Constraint Satisfaction Problems: Complexity and Approximability | (P) |
| GR/T05325/01 | Complexity of Constraint Optimisation on ordered Domains: An initial Study | (P) |
| GR/R29598/01 | Algebraic Structural Methods and Complexity of Constraint Satisfaction | (C) |
|
|
Key: (P)=Principal Investigator, (C)=Co-Investigator, (R)=Researcher Co-Investigator
|
| |
|
|
|
|