Alchemistry of the P versus NP question

Simple item page
dc.creatorDonat, Bonifac
dc.date2004-06-21
dc.date2004-06-26
dc.date.accessioned2026-07-07T03:21:28Z
dc.date.available2026-07-07T03:21:28Z
dc.descriptionAre P and NP provably inseparable ? Take a look at some unorthodox, guilty mentioned folklore and related unpublished results.
dc.identifierhttps://arxiv.org/abs/cs/0406040
dc.identifierhttp://arxiv.org/abs/cs/0406040
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32206
dc.subjectComputational Complexity
dc.subjectLogic in Computer Science
dc.titleAlchemistry of the P versus NP question
dc.typetext

Files

Collections

arXiv