Lectures related to Untitled | EPFL Graph Search

Covers the Euclidean algorithm for GCD calculation and algorithmic complexity analysis.

Explores Computational Molecular Design, emphasizing Mathematical Theory, High Performance Computing, and In Vivo Experiments.

Introduces the course syllabus, grading scheme, and classical and quantum computation models.

Introduces algorithms as problem-solving procedures, covering complexity, correctness, and implementation in various languages.

Covers fundamental concepts in number theory with examples and quizzes.

Covers function composition and integers, including properties and examples.

Explores the Random Feature Method for solving PDEs using machine learning algorithms to approximate high-dimensional functions efficiently.

Covers the Shor Algorithm for period finding and its application in factorization, discussing the circuit implementation and measurement outcomes.