BosonSampling Scott Aaronson (MIT) Talk at BBN, October 30, 2013.
The Computational Complexity of Linear Optics Scott Aaronson and Alex Arkhipov MIT vs.
Quantum Computing with Noninteracting Bosons Scott Aaronson (MIT) Based on joint work with Alex Arkhipov .
New Computational Insights from Quantum Optics Scott Aaronson Based on joint work with Alex Arkhipov.
Approximate List- Decoding and Hardness Amplification Valentine Kabanets (SFU) joint work with Russell Impagliazzo and Ragesh Jaiswal (UCSD)
10.1.1.132.7958
A course in cryptography
sb400161v
Lecture Notes on Cryptography
Manipulation, Control, and Beyond: Computational Issues in Weighted Voting Games Edith Elkind (U. of Southampton) Based on joint work with: Y.Bachrach,
Using computational hardness as a barrier against manipulation Vincent Conitzer [email protected].
On Decentralized Incentive Compatible Mechanisms for Partially Informed Environments by Ahuva Mu’alem June 2005 presented by Ariel Kleiner and Neil Mehta.
