@article{M2AN_1970__4_2_33_0, author = {Werner, G.}, title = {Quelques remarques sur la complexit\'e des algorithmes}, journal = {Revue fran\c{c}aise d'informatique et de recherche op\'erationnelle. S\'erie rouge}, pages = {33--50}, publisher = {Dunod}, address = {Paris}, volume = {4}, number = {R2}, year = {1970}, mrnumber = {297574}, zbl = {0209.03302}, language = {fr}, url = {http://archive.numdam.org/item/M2AN_1970__4_2_33_0/} }
TY - JOUR AU - Werner, G. TI - Quelques remarques sur la complexité des algorithmes JO - Revue française d'informatique et de recherche opérationnelle. Série rouge PY - 1970 SP - 33 EP - 50 VL - 4 IS - R2 PB - Dunod PP - Paris UR - http://archive.numdam.org/item/M2AN_1970__4_2_33_0/ LA - fr ID - M2AN_1970__4_2_33_0 ER -
Werner, G. Quelques remarques sur la complexité des algorithmes. Revue française d'informatique et de recherche opérationnelle. Série rouge, Tome 4 (1970) no. R2, pp. 33-50. http://archive.numdam.org/item/M2AN_1970__4_2_33_0/
[1] On the Computational Complexity of Algorithms » Trans. Amer. Math. Soc., 117, pp. 285-306 (1965). | MR | Zbl
, . «[2] Memory bounds for the recognition of context-free and context-sensitive languages », 1965,IEEE Conference Reord on Switching Circuit Theory and Logical Design, pp. 191-202, IEEE, New York (1965). | Zbl
, et «[3] Tape-Reversal Bounded Turing Machine Computations », Journal of Computer and System Sciences 2, Nr 2, pp. 117-135 (1968). | MR | Zbl
, «[4] Classes of Predictably Computable Functions », Trans. Amer. Math. Soc, 106, pp. 139-173 (1963). | MR | Zbl
, «[5] Degrees of Difficulty of Computing a Function and a Partial Ordering of Recursive Sets », Technical Reporter Nr 2, Hebrew University, Jérusalem, (1960).
, «[6] A Machine-Independent Theory of the Complexity of Recursive Functions », Journal A.C.M., avril 1967, vol. 14, Nr 2, pp. 322-336. | MR
, «[7] Recursive Function Theory and Speed of Computation », Canadian Math. Bull. 9 (1966), pp. 745-750. | Zbl
, «[8] Klassen rekursiver Funktionen », Lecture Notes in Math. 70, 1968, Springer-Verlag, Berlin, pp. 159-222. | MR | Zbl
, «[9] Extension of an Effectively Generated Class of Functions by Enumeration », Colloquium Math. VI (1958), pp. 67-78. | MR | Zbl
, «[10] Theory of Recursive Functions and Effective Computability, Mac Graw-Hill Book Company, New York, 1967. | MR | Zbl
,