Polynomial time algorithm for 3-SAT. Examples of use

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

The algorithm checks the propositional formulas for patterns of unsatisfiability.
19 pages

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/126095

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv