A Polynomial Time Algorithm for 3-SAT

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT.
9 pages. The version consolidates results and shares know-how

Keywords

Computational Complexity, Discrete Mathematics, Data Structures and Algorithms, Logic in Computer Science, F.2.0; G.2.1; G.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/164882

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0701023
 http://arxiv.org/abs/cs/0701023

Collections

arXiv