N=NP?

Hello guys,
I got really bored and then decided to work on P=NP(or not) problem. I guess people here are familiar with it.

I am trying to be optimistic and try to find an algorithm for an NP class problem namely subset sum problem. There are some variations of this problem and I want to ask whether the list given (I assume they are integers) should be a list that every element is unique or the numbers can repeat.


I personally do not discard the possibility of P=NP and lately this belief motivates me.

Best,
elasolova

You mean P=NP?

As for the subset sum problem: the input is not a list, but a set. So per definition each element is unique. However, even if it was a list and multiple occurrences were allowed, this would not make a difference.

Have fun on your quest! Let us know how it turns out. ;)

Yeah sorry I mean P=NP.

What do you think? Can this be ever solved?

I started to think that this cannot be solved with the current state of our understanding of math and computer science. Maybe a new formulation, a new concept is needed. And I also believe that quantum computation may play a role in it. I would like to hear your comments.

And yeah, it implies uniqueness as it is a set after all. I forgot about that.

The knowledge I have about this topic is too limited to make any meaningful comment about it. ;)