Recent content by Rilegatore

You want to say there is an algorithm of translation 3-SAT (CNF) to the conjuction of two logic formulas for which we can find values of variables when it's sat or to find it's unsat for any values of variables. And it's possible to make it for both formulas in polynomial time? I'm trying to...

Do you mean paper? It exists just in Russian.

This doesn't for what? Such representation - it's new view on class NP. It doesn't means P=NP or something else great result.

Thanks for answers. I don't talk about "3-SAT=P". But when I talk "3-SAT = P and P" I mean I can represent any general 3-SAT formula as conjunction (with "and" operation) of two (and only two) polynomial formulas. That means for each of this formulas I can find value of variables when the...

I need a consult. There is representing of 3-SAT formula as a conjunction of pair logical formulas. Each of this formulas has polynomial algorithm for searching response about its satisfiability and (if the formula sat - we can find in polynomial time any decision of all possible). It is not...