On Effective Procedures for Speeding Up Algorithms

DOI10.1145/321637.321648zbMath0221.02016OpenAlexW2131389166MaRDI QIDQ5625127

No author found.

Publication date: 1971

Published in: Journal of the ACM (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Related Items (21)

Characterization of realizable space complexities ⋮ On Low for Speed Oracles ⋮ Complexity classes of provable recursive functions ⋮ Computational speed-up by effective operators ⋮ Complexity of algorithms and computations ⋮ Classifying the computational complexity of problems ⋮ Two notions of correctness and their relation to testing ⋮ On complexity properties of recursively enumerable sets ⋮ THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS ⋮ On low for speed oracles ⋮ Implicit measurements of dynamic complexity properties and splittings of speedable sets ⋮ General random sequences and learnable sequences ⋮ On the polynomial IO-complexity ⋮ Speed-up theorems in type-2 computations using oracle Turing machines ⋮ Computational complexity, speedable and levelable sets ⋮ The complexity of the word problems for commutative semigroups and polynomial ideals ⋮ Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems ⋮ Toward an abstract theory of data compression ⋮ Intensional Kleene and Rice theorems for abstract program semantics ⋮ Relativization of the Theory of Computational Complexity ⋮ Uncontrollable computational growth in theoretical physics

This page was built for publication: On Effective Procedures for Speeding Up Algorithms