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.
On November 27, 1852, Augusta Ada King, Countess of Lovelace, who is considered to be the world's very first programmer, passed away. Every student of computer science should have heart of the world's first programmer, Ada Countess of Lovelace, assistant to Charles Babbage, inventor of the very first programmable (mechanical) computer, the analytical engine.
Ce site regroupe des plans de leçons, des développements, des rapports de jury, un éditeur de couplage et encore d'autres outils facilitant la préparation à l'agregation de mathématiques.
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.