On size vs. efficiency for programs admitting speed-ups
From MaRDI portal
Publication:5674405
DOI10.2307/2271512zbMath0258.68023MaRDI QIDQ5674405
No author found.
Publication date: 1971
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2271512
68Q25: Analysis of algorithms and problem complexity
03D20: Recursive functions and relations, subrecursive hierarchies
Related Items
Computational speed-up by effective operators, Effective category and measure in abstract complexity theory, Uncontrollable computational growth in theoretical physics, Complexity of algorithms and computations, On recursive bounds for the exceptional values in speed-up, Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems
Cites Work