Gergő Czuczor

The first problem, that I met with, on the topic of "hard" problems, was the Travelling salesman problem during my BSc studies, this was the time when I became interested in if I could find a better solution to the existing problems or not. Back then I did not know, how hard it was going to be.

As I have met more and more problems with similar hardness, I started to learn the connections among them. I have also written about this topic in my MSc thesis where basically I have almost found a way to solve the problems in NP in pseudo-polynomial time. Almost, because I have only realized the last missing step for it later.

First, I just wanted to show that I am going to be able to find an algorithm that solves all of the given problems, knowing that I had to solve only one of these problems “efficiently". Little did I know, that I was working on something impossible and I should have been working on finding a problem, of which it is easier to show, that it cannot be solved “fast".

Currently, I have a sound idea of proving that P != NP. Still, it is really hard to find people who could help me validate my approach and point out potential flaws without simply rejecting to read the rest of the proof after finding the first typo. Still, I am not going to give up working on it, as I feel that I am on the right track. 😊