A Polynomial Time Algorithm for 3-SAT

Simple item page
dc.creatorGubin, Sergey
dc.date2007-01-04
dc.date2008-07-15
dc.date.accessioned2026-07-07T09:50:16Z
dc.date.available2026-07-07T09:50:16Z
dc.descriptionArticle describes a class of efficient algorithms for 3SAT and their generalizations on SAT.
dc.description9 pages. The version consolidates results and shares know-how
dc.identifierhttps://arxiv.org/abs/cs/0701023
dc.identifierhttp://arxiv.org/abs/cs/0701023
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/164882
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.titleA Polynomial Time Algorithm for 3-SAT
dc.typetext

Files

Collections

arXiv