This page provides quick links to lecture notes that I have written for various classes: CS254: A graduate class on computational complexity (Stanford) [Spring 2010 Class Home Page] [Notes for Lectures 1-8] CS278: A graduate class on computational complexity (Berkeley) [Spring 2001 Class Home Page] [Fall 2002 Class Home Page] [2001 Lecture Notes in book…
Holographic storage for distributed applications -- a validating monotonic DHT "backed" by authoritative hashchains for data provenance (a Ceptr sub-project) - holochain/holochain-proto
What’s easy for a computer to do, and what’s almost impossible? Those questions form the core of computational complexity. We present a map of the landscape: P, NP, etc.
M. Brennan, and G. Bresler. (2020)cite arxiv:2005.08099Comment: 175 pages; subsumes preliminary draft arXiv:1908.06130; accepted for presentation at the Conference on Learning Theory (COLT) 2020.
Y. Zhang, M. Wainwright, and M. Jordan. Proceedings of The 27th Conference on Learning Theory, volume 35 of Proceedings of Machine Learning Research, page 921--948. Barcelona, Spain, PMLR, (13--15 Jun 2014)