2000 character limit reached
$P\not=NP$ relative to a $P$-complete oracle (2305.02226v1)
Published 1 Apr 2023 in cs.CC
Abstract: The $P$ versus $NP$ problem is still unsolved. But there are several oracles with $P$ unequal $NP$ relative to them. Here we will prove, that $P\not=NP$ relative to a $P$-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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.