Separating the complexity classes NL and NP

Simple item page
dc.creatorBenson, David B.
dc.date2000-04-17
dc.date2000-05-12
dc.date.accessioned2026-07-07T03:16:10Z
dc.date.available2026-07-07T03:16:10Z
dc.descriptionWithdrawn since -order- was overlooked. First order reductions without order are much too weak to separate.
dc.descriptionWithdrawn
dc.identifierhttps://arxiv.org/abs/cs/0004009
dc.identifierhttp://arxiv.org/abs/cs/0004009
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30247
dc.subjectComputational Complexity
dc.subjectF.1.3; F.4.1
dc.titleSeparating the complexity classes NL and NP
dc.typetext

Files

Collections

arXiv