New line to attack the P versus NP question

The P versus NP question is considered a major open problem for both
Computer Science and Mathematics.

There have been a few (relevant) efforts to solve the question in recent
times, but the problem is still considered open.

The line of attack set forth at arXiv:0802.1790, 0805.3058 [cs.CC] has
peculiar features:

(i) It is sustained by a new theory (of an algebraic character)
that apparently cannot be compressed in few pages.

(ii) New structural properties of SAT are used (that express internal
independence of this problem).

(iii) The theory has applications to diverse fields.

(iv) Most of the algebra lends itself to verifications through computer
experiments.

Comments and suggestions are welcome!

Thanks for attention,
curbastro@xxxxxxxxxx


.