Analyse de la complexité des programmes, des algorithmes et des problèmes
Publications du Département de mathématiques (Lyon) (1982)
- Issue: 1B, page 1-13
- ISSN: 0076-1656
Access Full Article
topHow to cite
topChein, M.. "Analyse de la complexité des programmes, des algorithmes et des problèmes." Publications du Département de mathématiques (Lyon) (1982): 1-13. <http://eudml.org/doc/273360>.
@article{Chein1982,
author = {Chein, M.},
journal = {Publications du Département de mathématiques (Lyon)},
language = {fre},
number = {1B},
pages = {1-13},
publisher = {Université Claude Bernard - Lyon 1},
title = {Analyse de la complexité des programmes, des algorithmes et des problèmes},
url = {http://eudml.org/doc/273360},
year = {1982},
}
TY - JOUR
AU - Chein, M.
TI - Analyse de la complexité des programmes, des algorithmes et des problèmes
JO - Publications du Département de mathématiques (Lyon)
PY - 1982
PB - Université Claude Bernard - Lyon 1
IS - 1B
SP - 1
EP - 13
LA - fre
UR - http://eudml.org/doc/273360
ER -
References
top- (1) Aho ( A.V.), Hopcroft ( J.E.), Ullman ( J.D.) - The design and analysis of computer algorithms. - Addison-Wesly, 1974. Zbl0326.68005MR413592
- (2) Borodin ( A.), Munro ( I.) - The computational complexity of algebraic and numeric problems. - Elsevier Computing Science Library, 1975. Zbl0404.68049MR468309
- (3) Garey, Johnson ( D.S.) - Computers and intractability. - W.H. Freeman and C°, 1979. Zbl0411.68039MR519066
- (4) Knuth ( D.E.) - The Art of computer programming. - Addison-Wesley, 1968, Vol. 1. Zbl1170.68411MR378456
- Knuth ( D.E.) - The Art of computer programming. - Addison-Wesley, 1969, Vol. 2. Zbl1127.68068
- Knuth ( D.E.) - The Art of computer programming. - Addison-Wesley, 1973. Vol. 3. Zbl1170.68411
- (5) Chvatal - Determining the stability number of a graph. - S.I.A.M.,J. Comput.6, 1977, p. 643-662. Zbl0395.05047MR485563
- (6) Cohen ( J.) - A langage for inquiring about the run-time behaviour of programs. - Software, 7, 1977, p. 445-460. Zbl0361.68017
- (7) Cohen ( J.), Roth ( M.) - On the implementation of Strassen's fast multiplication algorithm. - Acta Informatica, 6, 1978, p. 341-355. Zbl0312.68026MR411237
- (8) Cohen ( J.), Zuckerman ( C.) - Two languages for estimating program efficiency. - C.A.C.M., 17, 6, 1974, p. 301-308. Zbl0279.68014
- (9) Diarmid ( Mc) - Determining the chromatic number of a graph. - S.I.A.M., J. Comput, 1, 1979, p. 1-14. Zbl0401.05043MR522966
- (10) Karp ( R.M.) - The probabilistic analysis of some combinatorial search algorithms, in J.F. Traub (Ed), Algorithms and Complexity, Academic Press, 1976 Zbl0368.68035MR445898
- (11) Knuth ( D.E.) - The analysis of algorithms. - Actes, Congrès Inter. Math., 1970, t.3, p. 269-274. Zbl0279.68041MR423865
- (12) Knuth ( D.E.) - An empirical study of fortran programs. - Software, 1, 1971, p. 105-133. Zbl0243.68003
- (13) Knuth ( D.E.) - Big micron and big omega and big theta. - Sigact news, Apr.-June 1976, p. 18-24.
- (14) Knuth ( D.E.), Moore ( R.W.) - An analysis of Alpha-Beta pruning. - Artificial intelligence, 6, 1975, p. 293-326. Zbl0358.68143MR388881
- (15) Rivest ( R.L.), Vuillemin ( J.) - On recognizing graph properties from adjacency matrices. - Theor. Comput. Sc., 3, 1976, p. 371-384. Zbl0358.68079MR521075
- (16) Piwowarski ( P.) - A nesting level complexity measure. - STGPLAN, Notices, 17, 9, 1982, p. 44-50
- (17) Yao ( Chi-Chih) - A lower bound to finding convex hulls. - J.A.C.M., 28, 4, 1981, p. 780-787. Zbl0468.68080MR677089
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.