Pages that link to "Item:Q354658"
From MaRDI portal
The following pages link to Parallel approximation of min-max problems (Q354658):
Displaying 9 items.
- Parallel approximation of min-max problems (Q354658) (← links)
- Epsilon-net method for optimizations over separable states (Q496030) (← links)
- A parallel cost-optimal algorithm to compute the supremum of max-min powers (Q1195163) (← links)
- Hierarchical design of fast minimum disagreement algorithms (Q1704562) (← links)
- A parallel implementation of the simplex function minimization routine (Q2461663) (← links)
- (Q4374719) (← links)
- Parallel minimax search for a maximum (Q5532828) (← links)
- Massively Parallel Algorithms for Minimum Cut (Q5855214) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)