How to solve kSAT in polynomial time

Algirdas Antano Maknickas

With using of multi-nary logic analytic formulas proposition that "kSAT is in P and could be solved in $O(n^{3.5})$" was proved

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment