Speedup theorem
id:
speedup-theorem-295-9724123
title:
Speedup theorem
text:
In computational complexity theory, a speedup theorem is a theorem that for any algorithm demonstrates the existence of a more efficient algorithm solving the same problem. Examples: Linear speedup theorem, that the space and time requirements of a Turing machine solving a decision problem can be reduced by a multiplicative constant factor.
Blum's speedup theorem, which provides speedup by any computable function.
brand slug:
wiki
category slug:
encyclopedia
description:
Computational theorem
original url:
https://en.wikipedia.org/wiki/Speedup_theorem
date created:
date modified:
2023-09-02T10:53:08Z
main entity:
{"identifier":"Q774599","url":"https://www.wikidata.org/entity/Q774599"}
image:
fields total:
13
integrity:
14