scientific article; zbMATH DE number 895368
From MaRDI portal
Publication:4883380
zbMath0847.90117MaRDI QIDQ4883380
Publication date: 26 September 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (9)
On the complexity of approximating the VC dimension. ⋮ Network-formation games with regular objectives ⋮ The Exact Computational Complexity of Evolutionarily Stable Strategies ⋮ Beyond NP: Quantifying over Answer Sets ⋮ In Memoriam: Ker-I Ko (1950–2018) ⋮ The maximum clique interdiction problem ⋮ Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms ⋮ Synthesis from component libraries with costs ⋮ Computational complexity of multi-player evolutionarily stable strategies
This page was built for publication: