2020-2021 2021-2022 2022-2023 2023-2024 2024-2025
Browse
by subject...
    Schedule
view...
 

1 - 1 of 1 results for: MATH159

MATH 159: Discrete Probabilistic Methods

Modern discrete probabilistic methods suitable for analyzing discrete structures of the type arising in number theory, graph theory, combinatorics, computer science, information theory and molecular sequence analysis. Prerequisite: Math 151, Stats 117 or equivalent level of probability knowledge.
Terms: Win | Units: 4 | UG Reqs: WAY-FR
Instructors: Dembo, A. (PI)
Filter Results:
term offered
updating results...
teaching presence
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints