| EPSRC Reference: |
EP/X030032/1 |
| Title: |
The Science of Solving Hard Subgraph Problems |
| Principal Investigator: |
McCreesh, Dr C |
| Other Investigators: |
|
| Researcher Co-Investigators: |
|
| Project Partners: |
|
| Department: |
School of Computing Science |
| Organisation: |
University of Glasgow |
| Scheme: |
New Investigator Award |
| Starts: |
01 January 2024 |
Ends: |
31 December 2026 |
Value (£): |
360,843
|
| EPSRC Research Topic Classifications: |
| Artificial Intelligence |
Fundamentals of Computing |
|
| EPSRC Industrial Sector Classifications: |
|
| Related Grants: |
|
| Panel History: |
| Panel Date | Panel Name | Outcome |
|
24 Apr 2023
|
EPSRC ICT Prioritisation Panel April 2023
|
Announced
|
|
|
Summary on Grant Application Form |
|
Subgraph-finding problems involve identifying patterns in structured data. In theory these problems should be computationally hard for an algorithm to solve, but in practice intelligent constraint-based algorithms can quickly solve even large problems. This research will uses scientific (rather than purely mathematical) techniques to increase our understanding of this gap between theory and practice, and will allow us to design better algorithms in the future. The research is based upon analysing proof logs, which are a mathematical description of how an algorithm reached its answer.
|
|
Key Findings |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Potential use in non-academic contexts |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Impacts |
|
| Description |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk |
| Summary |
|
| Date Materialised |
|
|
|
|
Sectors submitted by the Researcher |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
| Project URL: |
|
| Further Information: |
|
| Organisation Website: |
http://www.gla.ac.uk |