Answers are grounded in this paper and cite their sources.
In this paper, it is proven that when both randomization and interaction are allowed, the proofs that can be verified in polynomial time are exactly those proofs that can be generated with polynomial space.
No takes yet. Share an insight, caveat, or question.
Adi Shamir (1992) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: