Did you try your algorithm on some test instances of 3-SAT?
For example:
http://people.sc.fsu.edu/~jburkardt/data/cnf/hole6.cnf
MiniSAT solves it in less than 1 second.
If your algorithm solves it in < 1 minute then you can increase the
curiosity on your paper (and a deeper review of it).
I think that the best way to convince everyone that a polynomial
algorithm for 3-SAT is correct, is to show that "it works" in some
programming language.
Regards,
Vor