AI Chat AI Image Generator AI Video Text to Speech

P≠NP relative to a P-complete oracle

04/01/2023

∙

by Reiner Czerwinski, et al.

∙

∙

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≠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.

research

∙ 10/18/2019

P-Optimal Proof Systems for Each coNP-Complete Set and no Complete Problems in NP∩coNP Relative to an Oracle

We build on a working program initiated by Pudlák [Pud17] and construct ...

0 Titus Dose, et al. ∙

research

∙ 12/27/2018

Approximate counting and NP search problems

We study a new class of NP search problems, those which can be proved to...

0 Leszek Aleksander Kołodziejczyk, et al. ∙

research

∙ 10/21/2022

Complexity and Ramsey Largeness of Sets of Oracles Separating Complexity Classes

We prove two sets of results concerning computational complexity classes...

0 Alex Creiner, et al. ∙

research

∙ 05/04/2022

Separations in Proof Complexity and TFNP

It is well-known that Resolution proofs can be efficiently simulated by ...

0 Mika Göös, et al. ∙

research

∙ 11/20/2017

Critique of Barbosa's "P != NP Proof"

We review André Luiz Barbosa's paper "P != NP Proof," in which the class...

0 Jackson Abascal, et al. ∙

research

∙ 01/31/2023

Limits of structures and Total NP Search Problems

For a class of finite graphs, we define a limit object relative to some ...

0 Ondřej Ježil, et al. ∙

research

∙ 01/22/2018

Polynomial-Time Random Oracles and Separating Complexity Classes

Bennett and Gill (1981) showed that P^A != NP^A != coNP^A for a random o...

0 John M. Hitchcock, et al. ∙