How to solve kSAT in polynomial time (Q2627596)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6724861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to solve kSAT in polynomial time |
scientific article; zbMATH DE number 6724861 |
Statements
How to solve kSAT in polynomial time (English)
0 references
31 May 2017
0 references
Summary: With using of multi-valued logic analytic formulas proposition that kSAT is in P and could be solved in \(O(n^{3.5})\) is proved.
0 references
kSAT
0 references
linear programming
0 references
multi-valued logic
0 references
polynomial time algorithm
0 references
satisfiability
0 references
