Rafael Pass, Muthuramakrishnan Venkitasubramaniam. Is it Easier to Prove Theorems that are Guaranteed to be True?. Electronic Colloquium on Computational Complexity (ECCC), 27:51, 2020. [doi]
@article{PassV20,
title = {Is it Easier to Prove Theorems that are Guaranteed to be True?},
author = {Rafael Pass and Muthuramakrishnan Venkitasubramaniam},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/051},
researchr = {https://researchr.org/publication/PassV20},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {27},
pages = {51},
}