EFFECTIVE PROCEDURES FOR SPEEDING UP ALGORITHMS

[1] A MACHINE-INDEPENDENT THEORY OF COMPLEXITY OF RECURSIVE FUNCTIONS [J]. JOURNAL OF THE ACM, 1967, 14 (02) : 322 - &

[2] ON COMPUTATIONAL COMPLEXITY OF ALGORITHMS [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1965, 117 (05) : 285 - +

[3] MEYER AR, 1968, 9 IEEE C REC ANN S S, P351

[4] RITCHIE DM, 1968, THESIS HARVARD U

[5] Rogers H., 1958, J SYMBOLIC LOGIC, V23, P331, DOI [10.2307/2964292, DOI 10.2307/2964292]

[6] Rogers Jr. H., 1967, MCGRAW HILL SERIES H

[7] YOUNG P, 1968, 9 IEEE ANN S SWITCH, P334

[8] YOUNG PR, 1969, MAY ACM S THEOR COMP, P89

[9] YOUNG PR, 1969, CDSTR43 PURD U DEP C

[1] A MACHINE-INDEPENDENT THEORY OF COMPLEXITY OF RECURSIVE FUNCTIONS [J]. JOURNAL OF THE ACM, 1967, 14 (02) : 322 - &

[2] ON COMPUTATIONAL COMPLEXITY OF ALGORITHMS [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1965, 117 (05) : 285 - +

[3] MEYER AR, 1968, 9 IEEE C REC ANN S S, P351

[4] RITCHIE DM, 1968, THESIS HARVARD U

[5] Rogers H., 1958, J SYMBOLIC LOGIC, V23, P331, DOI [10.2307/2964292, DOI 10.2307/2964292]

[6] Rogers Jr. H., 1967, MCGRAW HILL SERIES H

[7] YOUNG P, 1968, 9 IEEE ANN S SWITCH, P334

[8] YOUNG PR, 1969, MAY ACM S THEOR COMP, P89

[9] YOUNG PR, 1969, CDSTR43 PURD U DEP C