Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

5 Publications


2021 | Conference Paper | LibreCat-ID: 48876
J. Bossek and M. Wagner, “Generating Instances with Performance Differences for More than Just Two Algorithms,” in Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2021, pp. 1423–1432, doi: 10.1145/3449726.3463165.
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 10586
C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
LibreCat | Files available | DOI
 

2016 | Conference Paper | LibreCat-ID: 48873
J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers,” in Learning and Intelligent Optimization, 2016, pp. 48–59, doi: 10.1007/978-3-319-50349-3_4.
LibreCat | DOI
 

2016 | Conference Paper | LibreCat-ID: 48874
J. Bossek and H. Trautmann, “Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference,” in Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037, 2016, pp. 3–12, doi: 10.1007/978-3-319-49130-1_1.
LibreCat | DOI
 

2014 | Journal Article | LibreCat-ID: 8171 | OA
S. Gharibian and J. Kempe, “Hardness of approximation for quantum problems,” Quantum Information & Computation, vol. 14, no. 5–6, pp. 517–540, 2014.
LibreCat | Download (ext.) | arXiv
 

Filters and Search Terms

keyword="NP-hardness"

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed