Skip to main content Accessibility help
×
Home

On size vs. efficiency for programs admitting speed-ups

  • John Helm (a1) and Paul Young (a2)

Abstract

  • An abstract is not available for this content so a preview has been provided below. Please use the Get access link above for information on how to access this content.

Copyright

References

Hide All
[1]Blum, Manuel, A machine independent theory of the complexity of recursive functions, Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 322336.
[2]Blum, Manuel, On the size of machines, Information and control, vol. 11 (1967), pp. 257265.
[3]Blum, Manuel, On effective procedures for speeding up algorithms, Journal of the Association for Computing Machinery (to appear).
[4]Meyer, A. R. and Fischer, P. C., On computational speed-up. Conference Record Ninth Annual IEEE Symposium on Switching and Automata Theory, 1968, pp. 351355.
[5]Young, P. R., Speed-ups by changing the order in which sets are enumerated. Mathematical systems theory (to appear).

On size vs. efficiency for programs admitting speed-ups

  • John Helm (a1) and Paul Young (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed