I am engineer researcher in Barcelona Autonomous University.
Having finishing my degree studies as a computer engineer and having
a fascination for the complexity field I have been involved for 10 months
in the research of an algorithm that helps to support strongly the conjeture
that N = NP. For those familiarized with the problem you can guess, I must have
created a SAT solver that I "think" it runs and works at a polynomial time.
Well, you guessed well. Now that "think" must be proved.
Right now my first steps are heading towards extend practice evaluations
with well know hard instances.
Though working now, I am reporting my results in the following weeks.
Stay tuned, you know science.
No comments:
Post a Comment