General Mathematics

    

An Efficient Probabilistic Algorithm for an Important NP Complete Problem in Mathematics

Authors: Cristian Dumitrescu

In this article I describe an efficient, randomized algorithm (section 4) that solves the 3- SAT problem (known to be NP complete) with high probability, and a bit of the history of the problem under consideration. In the last section I present an interesting application, based on an idea that belongs to Godel.

Comments: 11 Pages. I hope that the interested reader will implement and test the algorithm (contact information included in the article).

Download: PDF

Submission history

[v1] 2014-01-11 09:55:38
[v2] 2014-01-28 16:56:34
[v3] 2014-03-01 10:53:33
[v4] 2014-08-02 11:46:13

Unique-IP document downloads: 525 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus