Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version)
Abstract
The k-satisfiability problem is a well-known task in computational complexity theory. In this paper approach for it's solving is introduced.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.