Complexité algébrique
Publications mathématiques et informatique de Rennes (1985)
- Volume: 4, Issue: 4, page 96-122
Access Full Article
top
How to cite
topMaurras, Jean-François. "Complexité algébrique." Publications mathématiques et informatique de Rennes 4.4 (1985): 96-122. <http://eudml.org/doc/274783>.
@article{Maurras1985,
author = {Maurras, Jean-François},
journal = {Publications mathématiques et informatique de Rennes},
keywords = {algebraic complexity},
language = {fre},
number = {4},
pages = {96-122},
publisher = {Département de Mathématiques et Informatique, Université de Rennes},
title = {Complexité algébrique},
url = {http://eudml.org/doc/274783},
volume = {4},
year = {1985},
}
TY - JOUR
AU - Maurras, Jean-François
TI - Complexité algébrique
JO - Publications mathématiques et informatique de Rennes
PY - 1985
PB - Département de Mathématiques et Informatique, Université de Rennes
VL - 4
IS - 4
SP - 96
EP - 122
LA - fre
KW - algebraic complexity
UR - http://eudml.org/doc/274783
ER -
References
top- 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. Zbl0481.90063
- 2 C. Berge "Graphes et Hypergraphes", Dunod, Paris1970. Zbl0213.25702MR357173
- 3 G.B. Dantzig "Linear Programming and Extensions", Princeton University Press, Princeton, New Jersey, 1963. Zbl0997.90504MR201189
- 4 G.B. Dantzig "All shortest routes in a graph", Proc. I.C.C.Conference on Theory of Graph, RomeGordon and Breach, N.Y. p. 91-92. Zbl0189.24104MR221981
- 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. Zbl0132.20903MR177907
- 7 J. Edmonds "Systems of Distincts Representatives and Linear Algebra", J. Res. Nat. Bur. Stds. B 71 B (1967) 241-245. Zbl0178.03002MR229540
- 8 J. Edmonds and R.M. Karp , "Theoritical Improvements in Algorithmic Efficiency for Network Flow Problems", J. ACM19 (1972) 248-264. Zbl0318.90024
- 9 L.R. Ford and D.R. Fulkerson, "Flows in Networks", Princeton University Press, Princeton, New Jersey. Zbl0106.34802
- 10 D.R. Fulkerson "An out of Kilter Method for Minimal Cost Flow Problem", Siam J. Appl. Math., 9 (1961) 18-27. Zbl0112.12401
- 11 M.R. Garey, D.S. Johnson, "Computers and Intractability..." W.H. Freeman and Co. San Francisco (1979). Zbl0411.68039MR519066
- 12 L.G. Kachian "A Polynomial Algorithm in Linear Programming", Soviet Math. Dokl., 20 (1979) 191-194. Zbl0409.90079
- 13 R.M. Karp "Reducibility Among Combinatorial Problems", in Complexity of Computer Computations, R.E. Miller et. al (éds), Plenum Press, New-York, 1972. Zbl0366.68041MR378476
- 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. Zbl0509.90056MR623833
- 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. Zbl0365.68052MR480296
- 17 G.J. Minty "Monotone Networks", Proc. Roy. Soc. London, SER. A. 257 (1960) 194-212. Zbl0093.42106MR120163
- 18 M.O. Rabin "Probabilistic Algorithms" in Algorithms and Complexity, J.F. Traub ed., Academic Press., New-York, 1976. Zbl0384.60001MR464678
- 19 N.Z. Shor "Convergence Rate of the Gradient Descent with Dilatation of the space", Cybernetics6 (1970) 102-108. Zbl0243.90038
- 20 B.L. Van der Wanden, "Modern Algebra", Frederick Ungar Publishing Co. New-York, 1950. Zbl0039.00902
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.