arXiv Open Access 2012

How to solve kSAT in polynomial time

Algirdas Antano Maknickas

Lihat Sumber

Abstrak

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

cs.CC

Algirdas Antano Maknickas

APA MLA BibTeX

Maknickas, A.A. (2012). How to solve kSAT in polynomial time. https://arxiv.org/abs/1203.6020

Lihat di Sumber

Informasi Jurnal