$P\not=NP$ relative to a $P$-complete oracle
Computational Complexity
2023-05-04 v1
Abstract
The versus problem is still unsolved. But there are several oracles with unequal relative to them. Here we will prove, that relative to a -complete oracle. In this paper, we use padding arguments as the proof method. The padding arguments are not bounded by a computable function. Such as we can use methods from computability theory to separate complexity classes.
Cite
@article{arxiv.2305.02226,
title = {$P\not=NP$ relative to a $P$-complete oracle},
author = {Reiner Czerwinski},
journal= {arXiv preprint arXiv:2305.02226},
year = {2023}
}