P-Optimal Proof Systems for Each Set in NP but no Complete Disjoint NP-pairs Relative to an Oracle.

Published in: CoRR (2019)

Keyphrases

pairwise
computational complexity
np hard
dynamic programming
worst case
intelligent systems
management system
minimum cost
optimal solution
upper bound
np complete
complex systems
commercial systems
average distance