Independence of P vs. NP in regards to oracle relativizations
Computational Complexity
2008-09-04 v6
Abstract
This 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.
Keywords
Cite
@article{arxiv.0805.2170,
title = {Independence of P vs. NP in regards to oracle relativizations},
author = {Jerrald Meek},
journal= {arXiv preprint arXiv:0805.2170},
year = {2008}
}
Comments
14 Pages; ftp://ftp%40micrognu.com:anon%[email protected]/pnenp/oracle.pdf