The following pages link to (Q4883380):
Displaying 23 items.
- Network-formation games with regular objectives (Q342715) (← links)
- Synthesis from component libraries with costs (Q683714) (← links)
- Local approximability of max-min and min-max linear programs (Q693753) (← links)
- Area-time complexity of the unconstrained minimization problem (Q1087137) (← links)
- On combined minmax-minsum optimization (Q1333027) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- On the complexity of approximating the VC dimension. (Q1872731) (← links)
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
- The Exact Computational Complexity of Evolutionarily Stable Strategies (Q2937749) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- (Q3318584) (← links)
- (Q3337153) (← links)
- HYPER-MINIMIZATION IN O(n<sup>2</sup>) (Q3395144) (← links)
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms (Q3565458) (← links)
- (Q4383632) (← links)
- Beyond NP: Quantifying over Answer Sets (Q5108497) (← links)
- On complexity of the translational-cut algorithm for convex minimax problems (Q5925720) (← links)
- A general framework for evaluating and comparing soft clusterings (Q6492587) (← links)
- Reformulations and complexity of the clique interdiction problem by graph mapping (Q6558672) (← links)
