A simply exponential upper bound on the maximum number of stable matchings.
Anna R. KarlinShayan Oveis GharanRobbie WeberPublished in: STOC (2018)
Keyphrases
- maximum number
- upper bound
- lower bound
- worst case
- branch and bound
- upper and lower bounds
- branch and bound algorithm
- generalization error
- single item
- learning algorithm
- case study
- databases
- special case
- linear complexity
- sample complexity
- active learning
- expert systems
- objective function
- image segmentation
- information retrieval
- neural network