Reducing the complexity of reductions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Adptive quantum computation, constant depth quantum circuits and arthur-merlin games
Quantum Information & Computation
Verifying proofs in constant depth
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Cryptography in constant parallel time
Cryptography in constant parallel time
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
Verifying proofs in constant depth
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.89 |