A randomized, efficient algorithm for MAX2SAT

Cristian Dumitrescu (1)

1 Chercheur indépendant

In this paper I present a MAX2SAT algorithm based on the randomized algorithm of Papadimitriou from 1991. We also show that this algorithm finds a solution (if it exists) for a MAX2SAT problem equivalent to a 3SAT problem with high probability in polynomial time.

Mots clés: NP-complete problems; MAX2SAT

Domaines: Mathématiques générales [math.GM]; Mathématique discrète [cs.DM]; Algorithme et structure de données [cs.DS]

Cristian Dumitrescu. A randomized, efficient algorithm for MAX2SAT. 2016. ⟨hal-01423189⟩