On effective procedures for speeding up algorithms

DOI10.1145/800169.805420MaRDI QIDQ5402504zbMATH OpenOpenAlexFDO

Authors Manuel Blum

Publication date 14 March 2014

Published in Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/800169.805420

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Recommendations

• On recursive bounds for the exceptional values in speed-up
• scientific article; zbMATH DE number 6292628
• On the power of recursive optimizers
• scientific article; zbMATH DE number 3960974
• scientific article; zbMATH DE number 3858406

Cited in

(3)

• scientific article; zbMATH DE number 4176354 (Why is no real title available?)
• THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS
• scientific article; zbMATH DE number 4066861 (Why is no real title available?)

This page was built for publication: On effective procedures for speeding up algorithms

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