Functional programming with_scala
Polymorphism (oop) lecture33
Computation, Quantum Theory, and You Scott Aaronson, UC Berkeley Qualifying Exam May 13, 2002.
The Learnability of Quantum States Scott Aaronson University of Waterloo.
New Evidence That Quantum Mechanics Is Hard to Simulate on Classical Computers Scott Aaronson (MIT) Joint work with Alex Arkhipov.
Solving Hard Problems With Light Scott Aaronson (Assoc. Prof., EECS) Joint work with Alex Arkhipov vs.
The Computational Complexity of Linear Optics Scott Aaronson (MIT) Joint work with Alex Arkhipov vs.
Scott Aaronson (MIT) Based on joint work with John Watrous (U. Waterloo) BQP PSPACE Quantum Computing With Closed Timelike Curves.
Quantum Double Feature Scott Aaronson (MIT) The Learnability of Quantum States Quantum Software Copy-Protection.
On Non-Black-Box Proofs of Security Boaz Barak Princeton.
Seattle Area Software Quality Assurance Group Acceptance Test Driven Development (ATDD) in Practice This one-day class covers the whole ATDD cycle, including.
Test Case Design Methodologies (Black-box methods) P. Pavankumar, CSTE Moderator, [email protected] [email protected].
