Cristian Dumitrescu
Bsc. In Mathematics, Freelance Mathematician, 119 Young St., Ap. 11, Kitchener, Ontario N2h 4z3, Canada
An Efficient Probabilistic Algorithm For An Important Np Complete Problem In Mathematics
In this article I describe an efficient, randomized algorithm (section 3) that I think solves the 3- SAT problem (known to be NP complete) with high probability in polynomial time, 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. The appendix

Showing 0 to 10 of 1