Further Reflections on a Theory for Basic Algorithms

DOI10.1007/11775096_1MaRDI QIDQ5434375zbMATH OpenOpenAlexFDO

Authors Allan Borodin

Publication date 4 January 2008

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

Full work available at URL https://doi.org/10.1007/11775096_1

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• MAX SAT approximation beyond the limits of polynomial-time approximation
• scientific article; zbMATH DE number 1258327
• Publication:4938646
• scientific article; zbMATH DE number 1552232
• A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between

Cited in

(4)

• A trivial algorithm whose analysis is not: a continuation
• Remarks on the \(\mathrm A^{\ast\ast}\) algorithm
• Strassen's algorithm made (somewhat) more natural: A pedagogical remark
• On exponential time lower bound of Knapsack under backtracking

This page was built for publication: Further Reflections on a Theory for Basic Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434375)