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

DOI10.1007/978-3-540-74456-6_49zbMath1147.68516OpenAlexW1603021901MaRDI QIDQ3525600

Rahul Tripathi

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_49

Mathematics Subject Classification ID

Quantum computation (81P68)

This page was built for publication: Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument