Concept

Polynôme

Cours associés (30)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

MATH-106(f): Analysis II

Étudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles de plusieurs variables.

MATH-482: Number theory I.a - Algebraic number theory

Algebraic number theory is the study of the properties of solutions of polynomial equations with integral coefficients; Starting with concrete problems, we then introduce more general notions like alg

MATH-489: Number theory II.c - Cryptography

The goal of the course is to introduce basic notions from public key cryptography (PKC) as well as basic number-theoretic methods and algorithms for cryptanalysis of protocols and schemes based on PKC

MATH-101(d): Analysis I

Étudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles d'une variable.

MATH-101(en): Analysis I (English)

We study the fundamental concepts of analysis, calculus and the integral of real-valued functions of a real variable.

MATH-205: Analysis IV - Lebesgue measure, Fourier analysis

Learn the basis of Lebesgue integration and Fourier analysis

MATH-207(d): Analysis IV

The course studies the fundamental concepts of complex analysis and Laplace analysis with a view to their use to solve multidisciplinary scientific engineering problems.

MATH-616: Numerical methods for random PDEs and uncertainty

The course focuses on mathematical models based on PDEs with random parameters, and presents numerical techniques for forward uncertainty propagation, inverse uncertainty analysis in a Bayesian framew

MATH-683: Fine-grained and parameterized complexity

The classical distinction between polynomial time solvable and NP-hard problems is often too coarse. This course covers techniques for proving more fine-grained lower and upper bounds on complexity of

MATH-251(d): Numerical analysis

This course offers an introduction to numerical methods for the solution of mathematical problems as: solution of systems of linear and non-linear equations, functions approximation, integration and d