A new algorithm design technique for hard problems, building on methods of complexity theory

DOI10.1007/978-3-030-04618-7_23zbMath1522.68724OpenAlexW2901368154MaRDI QIDQ6073051

Andras Farago

Publication date: 16 October 2023

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-04618-7_23

zbMATH Keywords

complexity theoryalgorithm designerrorless heuristics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: A new algorithm design technique for hard problems, building on methods of complexity theory