Stop the war!
Остановите войну!
for scientists:
default search action
Chicago Journal of Theoretical Computer Science, 2012
Volume 2012, 2012
- Thomas Vidick:
A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the Gap-Hamming-Distance problem. - Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein:
Minimum and maximum against k lies. - Amir Yehudayoff:
Linear cover time for trees is exponentially unlikely. - Ishay Haviv, Oded Regev:
Hardness of the Covering Radius Problem on Lattices. - Alexander Kesselman, Kirill Kogan, Michael Segal:
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches. - Matthew McKague:
Interactive proofs with efficient quantum prover for recursive Fourier sampling. - Amir M. Ben-Amram, Niels H. Christensen, Jakob Grue Simonsen:
Computational Models with No Linear Speedup. - Ashley Montanaro:
Almost all decision trees do not allow significant quantum speed-up. - Attila Pereszlényi:
On Quantum Interactive Proofs with Short Messages. - Troy Lee, Frédéric Magniez, Miklos Santha:
Learning graph based quantum query algorithms for finding constant-size subgraphs.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.