Economy
Karnaugh Maps
DFA Minimization
The Guide to Being a Logisim User
Karnaugh maps
Ceng232 Decoder Multiplexer Adder
Artificial Intelligence
Chrisoph Lampert, Talk part 2
On the Parallel Complexity of Hierarchical Clustering and CC-Complete Problems Dr. Raymond Greenlaw School of Computing Armstrong Atlantic State University.
Computation, Quantum Theory, and You Scott Aaronson, UC Berkeley Qualifying Exam May 13, 2002.
The Polynomial Method In Quantum and Classical Computing Scott Aaronson (MIT) OPEN PROBLEM.
Quantum Lower Bound for the Collision Problem Scott Aaronson 1/10/2002 quant-ph/0111102 I was born at the Big Bang. Cool! We have the same birthday.
