Chapter1-2-3
The Power of Unentanglement Scott Aaronson (MIT) Salman Beigi (MIT) Andrew Drucker (MIT) | Bill Fefferman (Caltech) Peter Shor (MIT) | |
Quantum Computing and Dynamical Quantum Models ( quant-ph/0205059) Scott Aaronson, UC Berkeley QC Seminar May 14, 2002.
Arthur, Merlin, and Black-Box Groups in Quantum Computing Scott Aaronson (MIT) Or, How Laci Did Quantum Stuff Without Knowing It.
QMA/qpoly PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson University of Waterloo.
Two-dimensional Rational Automata: a bridge unifying 1d and 2d language theory Marcella Anselmo Dora Giammarresi Maria Madonia Univ. of Salerno Univ. Roma.
1 CS 3261 Computability Course Summary Zeph Grunschlag.
Randomized Distributed Decision David Peleg Joint work with: Pierre Fraigniaud Amos Korman Merav Parter.
Languages Generated by Programmed Grammars with Various Graphs Jurgen Dassow, Benedek Nagy, Cristina Bibire, Madalina Barbaiani, Szilard Fazekas, Aidan.
NLP (Fall 2013): NLP Areas, Chomisky Hierarchy, Finite State Automata, Regular Languages, Regular Expressions, Pattern Matching, ELIZA - NL Dialogue with Computer
Control structure
Cook-Levin Theorem Proof and Illustration Kwak, Nam-ju Applied Algorithm Laboratory KAIST 1 Applied Algorithm Lab. KAIST WSAC2010 Talk 11st, January, 2010.
