no. 4
Complexité algébrique
Publications de l'Institut de recherche mathématiques de Rennes, no. 4 (1985), pp. 96-122. 
@article{PSMIR_1985___4_96_0,
     author = {Maurras, Jean-Fran\c{c}ois},
     title = {Complexit\'e alg\'ebrique},
     journal = {Publications de l'Institut de recherche math\'ematiques de Rennes},
     pages = {96--122},
     publisher = {D\'epartement de Math\'ematiques et Informatique, Universit\'e de Rennes},
     number = {4},
     year = {1985},
     zbl = {0617.68043},
     language = {fr},
     url = {http://www.numdam.org/item/PSMIR_1985___4_96_0/}
}
TY  - JOUR
AU  - Maurras, Jean-François
TI  - Complexité algébrique
JO  - Publications de l'Institut de recherche mathématiques de Rennes
PY  - 1985
SP  - 96
EP  - 122
IS  - 4
PB  - Département de Mathématiques et Informatique, Université de Rennes
UR  - http://www.numdam.org/item/PSMIR_1985___4_96_0/
LA  - fr
ID  - PSMIR_1985___4_96_0
ER  - 
%0 Journal Article
%A Maurras, Jean-François
%T Complexité algébrique
%J Publications de l'Institut de recherche mathématiques de Rennes
%D 1985
%P 96-122
%N 4
%I Département de Mathématiques et Informatique, Université de Rennes
%U http://www.numdam.org/item/PSMIR_1985___4_96_0/
%G fr
%F PSMIR_1985___4_96_0
Maurras, Jean-François. Complexité algébrique. Publications de l'Institut de recherche mathématiques de Rennes, no. 4 (1985), pp. 96-122. http://www.numdam.org/item/PSMIR_1985___4_96_0/

1 A. Bachem and M. Grostchel, "New Aspects of Polyhedral Theory" Rep. n° 79149-OR, Institut Für Okonometrie und Operation Research. Bonn Universität. | Zbl

2 C. Berge "Graphes et Hypergraphes", Dunod, Paris 1970. | MR | Zbl

3 G.B. Dantzig "Linear Programming and Extensions", Princeton University Press, Princeton, New Jersey, 1963. | MR | Zbl

4 G.B. Dantzig "All shortest routes in a graph", Proc. I.C.C. Conference on Theory of Graph, Rome Gordon and Breach, N.Y. p. 91-92. | MR | Zbl

5 E.W. Djikstra "A note on linear problems in connection with Graphs", Numerische Math. 1 . pp. 169-271.

6 J. Edmonds "Paths, Trees and Flowers", Can. J. Math. 17 (1965) 449-467. | MR | Zbl

7 J. Edmonds "Systems of Distincts Representatives and Linear Algebra", J. Res. Nat. Bur. Stds. B 71 B (1967) 241-245. | MR | Zbl

8 J. Edmonds and R.M. Karp , "Theoritical Improvements in Algorithmic Efficiency for Network Flow Problems", J. ACM 19 (1972) 248-264. | Zbl

9 L.R. Ford and D.R. Fulkerson, "Flows in Networks", Princeton University Press, Princeton, New Jersey. | Zbl

10 D.R. Fulkerson "An out of Kilter Method for Minimal Cost Flow Problem", Siam J. Appl. Math., 9 (1961) 18-27. | Zbl

11 M.R. Garey, D.S. Johnson, "Computers and Intractability..." W.H. Freeman and Co. San Francisco (1979). | MR | Zbl

12 L.G. Kachian "A Polynomial Algorithm in Linear Programming", Soviet Math. Dokl., 20 (1979) 191-194. | Zbl

13 R.M. Karp "Reducibility Among Combinatorial Problems", in Complexity of Computer Computations, R.E. Miller et. al (éds), Plenum Press, New-York, 1972. | MR | Zbl

14 J.F. Maurras "Bons Algorithmes, Vieilles Idées", Note E d F, HR 320320, 1978.

15 J.F. Maurras and K. Truemper and M. Akrül, "Polynomial Algorithms For a class of Linear Programs, Math. Programming, 21 (1981) 121-136. | MR | Zbl

16 G.L. Miller "Riemann's Hypothesis and Test for Primality", Proc. of the Seventh Annual ACM Symp. on Theory of Computing (1971) pp. 234-239. | MR | Zbl

17 G.J. Minty "Monotone Networks", Proc. Roy. Soc. London, SER. A. 257 (1960) 194-212. | MR | Zbl

18 M.O. Rabin "Probabilistic Algorithms" in Algorithms and Complexity, J.F. Traub ed., Academic Press., New-York, 1976. | MR | Zbl

19 N.Z. Shor "Convergence Rate of the Gradient Descent with Dilatation of the space", Cybernetics 6 (1970) 102-108. | Zbl

20 B.L. Van Der Wanden, "Modern Algebra", Frederick Ungar Publishing Co. New-York, 1950. | Zbl