Reducing SAT to 2-SAT

Simple item page
dc.creatorGubin, Sergey
dc.date2007-04-01
dc.date.accessioned2026-07-07T07:54:21Z
dc.date.available2026-07-07T07:54:21Z
dc.descriptionDescription of a polynomial time reduction of SAT to 2-SAT of polynomial size.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/0704.0108
dc.identifierhttp://arxiv.org/abs/0704.0108
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126571
dc.subjectComputational Complexity
dc.subjectF.2.0; G.2.1; G.2.2
dc.titleReducing SAT to 2-SAT
dc.typetext

Files

Collections

arXiv