Polynomial time algorithm for 3-SAT. Examples of use

Simple item page
dc.creatorGubin, Sergey
dc.date2007-03-21
dc.date.accessioned2026-07-07T07:53:01Z
dc.date.available2026-07-07T07:53:01Z
dc.descriptionThe algorithm checks the propositional formulas for patterns of unsatisfiability.
dc.description19 pages
dc.identifierhttps://arxiv.org/abs/cs/0703098
dc.identifierhttp://arxiv.org/abs/cs/0703098
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126095
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.subjectLogic in Computer Science
dc.subjectF.2.0; G.2.1; G.2.2
dc.titlePolynomial time algorithm for 3-SAT. Examples of use
dc.typetext

Files

Collections

arXiv