The stable marriage problem is a mathematical problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element. It requires pairing members of one set with members of the other set such that there are no two people of opposite sex who would both rather have each other than their current partners. This problem is distinct from the stable roommates problem as it involves two classes that need to be paired.
Stanford University
Winter 2023
This course provides an in-depth exploration of algorithm analysis and design. It covers various sorting, searching, and selection algorithms, data structures, and fundamental graph algorithms. It emphasizes the understanding of worst and average case analysis, recurrences, and asymptotics.
No concepts data
+ 30 more conceptsUC Berkeley
Fall 2022
CS 70 presents key ideas from discrete mathematics and probability theory with emphasis on their application in Electrical Engineering and Computer Sciences. It addresses a variety of topics such as logic, induction, modular arithmetic, and probability. Sophomore mathematical maturity and programming experience equivalent to an Advanced Placement Computer Science A exam are prerequisites.
No concepts data
+ 32 more conceptsCarnegie Mellon University
Fall 2018
The course provides a rigorous introduction to the foundations of computer science, improving abstract thinking skills and preparing students to be innovators in the field. Topics include computation, computational complexity, and real-world applications of computational concepts. Prerequisites imply this is an intermediate-level course.
No concepts data
+ 25 more concepts