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.
T. Dreyfus, C. Rasmussen, N. Apkarian, and M. Tabach. INDRUM 2018, (2018)"The complexity of knowledge flow in the classroom, even based on this one class session, is far greater than one might imagine. ".
J. Berner, P. Grohs, G. Kutyniok, and P. Petersen. (2021)cite arxiv:2105.04026Comment: This review paper will appear as a book chapter in the book "Theory of Deep Learning" by Cambridge University Press.