Towards a Doubly Efficient IP=PSPACE
Liyan Chen
·
2026-06-19
·
via Cryptology ePrint Archive
We show that every language in PSPACE decidable by a Turing machine in time $T(n)=n^{O(\log n)}$ admits a dou…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。