7 citations · 10 across the 2 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2012
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 " was proved
cs.CC2010★ 3 cited
Finding of k in Fagin's R. Theorem 24
Algirdas Antano Maknickas
By using of analytical multi-logic expresses in conjunction with non-deterministic Turing machine the proposition was proved that algorithm of deterministic Turing counter machine…