Barriers to Communication
Be2419772016
Using MBSE for Flight Test
The Polynomial Method In Quantum and Classical Computing Scott Aaronson (MIT) OPEN PROBLEM.
The Learnability of Quantum States Scott Aaronson University of Waterloo.
What Have I Learned From Scott AaronsonDave Bacon PhysicistsComputer Scientists and What Else Would I Like to Learn from Them?
Quantum Double Feature Scott Aaronson (MIT) The Learnability of Quantum States Quantum Software Copy-Protection.
The Complexity of Agreement A 100% Quantum-Free Talk Scott Aaronson MIT.
Computing with Polynomials over Composites Parikshit Gopalan Algorithms, Combinatorics & Optimization. Georgia Tech.
Optimal Space Lower Bounds for all Frequency Moments David Woodruff Based on SODA 04 paper.
Truthful Mechanisms for Combinatorial Auctions with Subadditive Bidders Speaker: Shahar Dobzinski Based on joint works with Noam Nisan & Michael Schapira.
Quantum Computation and Quantum Information Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan (biju@dcs) Assistant: Nick Papanikolaou.
