Questions ?

[Ricardo]

Dear Profa. M Angela Weiss:

I wonder if this particular case, "Polynomial
Algorithm for 3-SAT " can be generalized to "Polynomial Algorithm for
K-SAT " in P-SPACE ? And if the method used the "KE-tableaux methods"
self test ? So I think if this is really P = NP is proved.

Thank you for your attention.

[M Angela Weiss]

Dear Ricardo,
Generally one can rewrite a n-sat as a 3-sat and the algorithms used
to do that are polynomial, so, if one can polynomially solve 3-sat the
job is done for a n-sat. Space and time are "duals" as one change
either space to time and vice-versa.
I am working in a new version of the paper. In that version, I can get
ride of the work frame "tableaux". I think that this new version is
clearer and plainer than the previous one. Still, I've found no
gaps ;-) . The program corresponding to the algorithm in my page is
being developed.
best,
angela