Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument.

Rahul Tripathi

Browse the full MFCS paper archive.