3 citations · 3 across the 1 of their papers we have counts for
1 paper
Sergey Kardash
The k-satisfiability problem is a well-known task in computational complexity theory. In this paper approach for it's solving is introduced.