Has any one reviewed this idea yet? <EoM>

[Soumik Jana]

Hi,
Has any one reviewed this idea yet?

[Roma]

Dear Soumik -
The idea was not reviewed yet. At this point, since it is not an easy
proof, the goal of this discussion group is precisely to clarify, as
much as possible, point by point, the contents of the manuscript to
the interested readers. I highlight that the manuscript is full of new
ideas but the definitions, proofs, and examples are complete - there
are no such things as "it is easy to see that..." or "if one proofs
this result then ...". Since the material is new, it requires,
possibly, discussions so one finds the most appropriate way to explain
it.

Alexandre

[Soumik Jana]

I haven't read your paper yet, but I think you should implement it and try different SAT instances, (HCP to SAT instances) to show people that it works even before analyzing the proof.

And also give a point to why 2-SAT is solved using DFS, Tarjan's strongly connected component and for 3-SAT it requires so complex technique.

If SAT can be solved then how this can be used for QBF? In my opinion a QBF solving technique won't be much different from the SAT solving technique.

There's one way you can be sure your proof is correct is that if you have found and answer for P-SPACE as well (i.e. QBF). All the best for your endeavor.

Thanks,

Soumik Jana

[M Angela Weiss]

Totally agreed! I will post the Algorithm in the page a.s.p.
best,
angela

--
 Dr M. Angela Weiss
 www.ime.usp.br/~weiss/
 Departamento de Matematica   
 Instituto de Matematica e Estatistica - USP
 Caixa Postal 66.281  
 05314-970    Sao Paulo, SP     Brazil    
 

Seek wisdom, not knowledge.
Knowledge is of the past,
Wisdom is of the future. (Lumbee)