Pages that link to "Item:Q878685"
From MaRDI portal
The following pages link to On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing (Q878685):
Displaying 4 items.
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- On minimizing the number of ADMs in a general topology optical network (Q967313) (← links)
- Minimization of SONET ADMs in ring networks revisited (Q2380804) (← links)
- On equilibria for ADM minimization games (Q2429352) (← links)