Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version)

Details Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version) Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version)

2011-07-30

arxiv.org/abs/1108.0408v1

Computer Science

Computational Complexity

Scientific paper

k-satisfiability problem is a well-known task in computational complexity
theory. In this paper approach for it's solving is introduced.

Affiliated with

Also associated with

No associations

Rating

Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-703376