Independence of P vs. NP in regards to oracle relativizations

Simple item page
dc.creatorMeek, Jerrald
dc.date2008-05-14
dc.date2008-09-04
dc.date.accessioned2026-07-07T10:00:10Z
dc.date.available2026-07-07T10:00:10Z
dc.descriptionThis is the third article in a series of four articles dealing with the P vs. NP question. The purpose of this work is to demonstrate that the methods used in the first two articles of this series are not affected by oracle relativizations. Furthermore, the solution to the P vs. NP problem is actually independent of oracle relativizations.
dc.description14 Pages; ftp://ftp%40micrognu.com:anon%40anon@ftp.micrognu.com/pnenp/oracle.pdf
dc.identifierhttps://arxiv.org/abs/0805.2170
dc.identifierhttp://arxiv.org/abs/0805.2170
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168258
dc.subjectComputational Complexity
dc.subjectF.2.0
dc.titleIndependence of P vs. NP in regards to oracle relativizations
dc.typetext

Files

Collections

arXiv