Algorithmics for hard problems.
From MaRDI portal
Publication:1773216
zbMath1069.68642MaRDI QIDQ1773216
Publication date: 26 April 2005
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) General topics in the theory of algorithms (68W01)
Related Items
Dynamic Grover search: applications in recommendation systems and optimization problems ⋮ Homotopy continuation approaches for robust SV classification and regression ⋮ The online knapsack problem: advice and randomization ⋮ On simplifying dot maps. ⋮ Removing nondeterminism in constant height pushdown automata ⋮ A theoretical study on the behavior of simulated annealing leading to a new cooling schedule ⋮ Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems ⋮ A randomized algorithm for determining dominating sets in graphs of maximum degree five ⋮ A fixed-parameter tractability result for multicommodity demand flow in trees
