| dbp:reason
|
- This proof relies on IP being a fully public-coin protocol: the full state of the verifier can be deterministically computed from its message history. IP is usually initially considered in terms of private-coin protocols. These turn out to be equivalent, but this is highly nontrivial, arguably a more difficult fact to proven than IP ⊆ PSPACE itself. (en)
|
.svg?width=300)
.svg){kind=link}
.svg){kind=link}