How to solve kSAT in polynomial time

TL;DR

This paper claims to have proved that kSAT, a well-known NP-complete problem, can be solved in polynomial time using multi-nary logic formulas, specifically in $O(n^{3.5})$ time.

Contribution

The paper presents a proof that kSAT is in P and provides an algorithm with polynomial time complexity.

Findings

kSAT can be solved in $O(n^{3.5})$ time

kSAT is in P according to the proof

The proposed method uses multi-nary logic formulas

Abstract

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