AI Chat AI Image Generator AI Video Text to Speech

A limitation on the KPT interpolation

04/06/2020

∙

by Jan Krajicek, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 03/19/2023

A proof complexity conjecture and the Incompleteness theorem

Given a sound first-order p-time theory T capable of formalizing syntax ...

0 Jan Krajicek, et al. ∙

research

∙ 09/05/2019

PNP and All Sets in NP∪coNP Have P-Optimal Proof Systems Relative to an Oracle

As one step in a working program initiated by Pudlák [Pud17] we construc...

0 Titus Dose, et al. ∙

research

∙ 09/05/2019

PNP and All Non-Empty Sets in NP∪coNP Have P-Optimal Proof Systems Relative to an Oracle

As one step in a working program initiated by Pudlák [Pud17] we construc...

0 Titus Dose, et al. ∙

research

∙ 04/22/2023

Read-once machines and the thermodynamic complexity of Maxwell's demons

The thermodynamical costs imposed by computational resource limitations ...

0 Fırat Kıyak, et al. ∙

research

∙ 01/09/2018

A detailed treatment of Doob's theorem

Doob's theorem provides guarantees of consistent estimation and posterio...

0 Jeffrey W. Miller, et al. ∙

research

∙ 04/02/2023

Ruling Out Short Proofs of Unprovable Sentences is Hard

If no optimal propositional proof system exists, we (and independently P...

0 Hunter Monroe, et al. ∙

research

∙ 03/20/2020

Failure of Feasible Disjunction Property for k-DNF Resolution and NP-hardness of Automating It

We show that for every integer k ≥ 2, the Res(k) propositional proof sys...

0 Michal Garlík, et al. ∙