加载中…
2011-07-30
Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version)
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本