A limitation on the KPT interpolation
Logic
2023-06-22 v3 Computational Complexity
Abstract
We prove a limitation on a variant of the KPT theorem proposed for propositional proof systems by Pich and Santhanam (2020), for all proof systems that prove the disjointness of two NP sets that are hard to distinguish.
Cite
@article{arxiv.2004.02448,
title = {A limitation on the KPT interpolation},
author = {Jan Krajíček},
journal= {arXiv preprint arXiv:2004.02448},
year = {2023}
}