Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the mechanization of the textbook proof of Huffman's algorithm, focusing on Huffman coding, optimal solutions, and functional implementation. It discusses the concepts of leaf and inner nodes, basic auxiliary functions, and intermediary lemmas. The lecture concludes with the formalization of the proof, custom induction rules, and the proposed extension of the proof's scope to applications.