@article{10.1145/146585.146609,
    Abstract = {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.},
    Address = {New York, NY, USA},
    Author = {Shamir, Adi},
    File = {IP = PSPACE - 146585.146609.pdf},
    ISSN = {0004-5411},
    Journal = {J. ACM},
    Keywords = {IP, interactive proofs, PSPACE},
    Month = {oct},
    Number = {4},
    Pages = {869--877},
    Publisher = {Association for Computing Machinery},
    Title = {IP = PSPACE},
    URL = {https://doi.org/10.1145/146585.146609},
    Volume = {39},
    Year = {1992},
    bdsk-url-1 = {https://doi.org/10.1145/146585.146609},
    date-added = {2023-10-02 11:44:38 +0200},
    date-modified = {2023-10-02 11:44:38 +0200},
    issue_date = {Oct. 1992},
    numpages = {9},
    doi = {10.1145/146585.146609}
}

@article{10.1145/146585.146609, Abstract = {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.}, Address = {New York, NY, USA}, Author = {Shamir, Adi}, File = {IP = PSPACE - 146585.146609.pdf}, ISSN = {0004-5411}, Journal = {J. ACM}, Keywords = {IP, interactive proofs, PSPACE}, Month = {oct}, Number = {4}, Pages = {869--877}, Publisher = {Association for Computing Machinery}, Title = {IP = PSPACE}, URL = {https://doi.org/10.1145/146585.146609}, Volume = {39}, Year = {1992}, bdsk-url-1 = {https://doi.org/10.1145/146585.146609}, date-added = {2023-10-02 11:44:38 +0200}, date-modified = {2023-10-02 11:44:38 +0200}, issue_date = {Oct. 1992}, numpages = {9}, doi = {10.1145/146585.146609} }