Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion.
David Yu Cheng ChanPhilipp WoelfelPublished in: PODC (2021)
Keyphrases
- lower bound
- mutual exclusion
- worst case
- upper bound
- long distance
- branch and bound
- objective function
- branch and bound algorithm
- average case complexity
- np hard
- optimal solution
- temporal planning
- average case
- decision problems
- lower and upper bounds
- computational complexity
- constraint programming
- vc dimension
- dynamic environments
- general purpose