A randomized algorithm for solving the satisfiability problem
Testo / risorsa
Testo / risorsa
In spite of the NP-completeness of the satisfiability decision problem (SAT problem), many researchers have been attracted by it because SAT has many applications in Artificial Intelligence. This paper presents a randomi...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access