Вход на сайт

Просмотр новости

Найдите то, что Вас интересует

Ján Pich awarded ERC Consolidator Grant for research into proof complexity

Дата публикации: 14-01-2026 12:00:00

His project ProCom will tackle foundational questions in computational complexity and mathematical logic.

Основное содержимое страницы с новостью.

Posted: 14th January 2026

Senior Researcher Ján Pich has been awarded a prestigious European Research Council (ERC) Consolidator Grant for his project ProCom, which tackles foundational questions in computational complexity and mathematical logic. 

Ján is one of only eleven researchers at Oxford – and among just 11.2% of applicants Europe-wide – to receive funding in this highly competitive call. Consolidator Grants support outstanding mid-career researchers in building research teams and advancing ambitious scientific ideas. The awards are funded by the EU’s Horizon Europe programme and provide around €2 million over five years. 

These ERC awards recognise exceptional ambition and talent. Each project has the potential to deepen scientific understanding and deliver tangible benefits for society – from biodiversity and climate resilience to sustainable technologies and advanced chemistry. Prof James (Jim) Naismith, Head of the Mathematical, Physical, and Life Sciences Division (MPLS)

ProCom (Proof complexity of circuit lower bounds)   

ProCom tackles a fundamental question in mathematics and computer science: are there explicit problems that are formally hard to solve? In other words, can we prove that certain mathematical questions, by their nature, will never have efficient solutions?  

Such questions can be investigated in the language of mathematical logic and complexity theory. Surprisingly, they have turned out to be extremely difficult and the flagship problem in the area, the P vs NP problem, has become notorious for that reason. It asks whether every problem whose solution can be verified quickly can also be solved quickly.   

In recent years, new meta-mathematical theory surrounding the P vs NP problem has emerged. The ProCom project aims to uncover its full potential. 

I am fascinated by the possibility of the existence of a simple algorithm automating (perhaps even without using a computer) difficult tasks such as proving mathematical theorems and shedding light on the very nature of creativity. Dr Ján Pich

Схожие новости

#Наименование новостиТональностьИнформативностьДата публикации
1Rahul Santhanam awarded ERC Advanced Grant for complexity theory research08.5717-06-2025
2Department of Computer Science professor secures €1.95m European research grant for quantum project06.2323-11-2023
3VERIPACE: new ERC Proof of Concept Grant awarded to Professor Marta Kwiatkowska01030-10-2013
4Associate Professor awarded European Research Council Starting Grant05.2905-09-2024
5Vincent Cheval awarded major EU research grant to investigate security of probabilistic systems07.3517-11-2025
6Bernardo Cuenca Grau is awarded new EPSRC Grant017.1428-07-2010
7EPSRC-funded research seeks to advance the reliability of essential computer systems0910-12-2024
8Visiting Professor Joël Ouaknine awarded €7.5M ERC Synergy grant05.4114-11-2024
9Professor Elias Koutsoupias awarded ERC Advanced Grant09.1323-06-2026
10Researchers win CAV 2025 Paper Award for work on model checking011.7204-08-2025

Классификация: Пресс-релизы. Схожих патентов: 0. Схожих новостей: 10. Тональность: 0. Информативность: 9.18. Источник: www.cs.ox.ac.uk.