Books on the topic 'Algorithmes de complexité paramétrés'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 23 books for your research on the topic 'Algorithmes de complexité paramétrés.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse books on a wide variety of disciplines and organise your bibliography correctly.
Wilf, Herbert S. Algorithmes et complexité. Paris: Masson, 1989.
L, Selman Alan, ed. Structure in complexity theory: Proceedings of the conference held at the University of California, Berkeley, California, June 2-5, 1986. Berlin: Springer-Verlag, 1986.
Scandinavian Workshop on Algorithm Theory (7th 2000 Bergen, Norway). Algorithm theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 5-7, 2000 ; proceedings. Berlin: Springer, 2000.
Scandinavian Workshop on Algorithm Theory (7th 2000 Bergen, Norway). Algorithm theory-- SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000 : proceedings. Berlin: Springer, 2000.
1955-, Djidjev H., Bŭlgarska akademii͡a︡ na naukite. Center of Informatics and Computer Technology., and International Symposium on Optimal Algorithms (2nd : 1989 : Varna, Bulgaria), eds. Optimal algorithms: International symposium, Varna, Bulgaria, May 29-June 2 1989 proceedings. Berlin: Springer-Verlag, 1989.
Wilf, Herbert S. Algorithms and complexity. Englewood Cliffs, N.J: Prentice-Hall, 1986.
Wilf, Herbert S. Algorithms and complexity. 2nd ed. Natick, Mass: A.K. Peters, 2002.
Hromkovič, Juraj. Algorithmics for hard problems: Introduction to combinatorial optimization, randomization, approximation, and heuristics, with 71 figures. 2nd ed. Berlin: Springer-Verlag, 2004.
Hromkovič, Juraj. Algorithmics for hard problems: Introduction to combinatorial optimization, randomization, approximation, and heuristics. 2nd ed. Berlin: Springer-Verlag, 2003.
Hromkovič, Juraj. Algorithmics for hard problems: Introduction to combinatorial optimization, randomization, approximation, and heuristics. Berlin: Springer, 2001.
(Editor), Lars Arge, and Rusins Freivalds (Editor), eds. Algorithm Theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings (Lecture Notes in Computer Science). Springer, 2006.
Arge, Lars, and Rusins Freivalds. Algorithm Theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings. Springer London, Limited, 2006.
A Guide To Algorithm Design Paradigms Methods And Complexity Analysis. CRC Press, 2013.
Michalewicz, Z., Thomas Baeck, and D. B. Fogel. Evolutionary Computation 1: Basic Algorithms and Operators. Taylor & Francis Group, 2018.
Michalewicz, Z., Thomas Baeck, and D. B. Fogel. Evolutionary Computation 1: Basic Algorithms and Operators. Taylor & Francis Group, 2018.
Michalewicz, Z., Thomas Baeck, and D. B. Fogel. Evolutionary Computation 1: Basic Algorithms and Operators. Taylor & Francis Group, 2018.
Blanton, Marina, and Mikhail J. Atallah. Foundations of Algorithms and Theory of Computation. Chapman & Hall/CRC, 2009.
Karlsson, R. Swat 88: 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, (Lecture Notes in Computer Science). Springer, 1988.
Gilbert, J. R. Swat '90: 2nd Scandinavian Workshop on Algorithm Theory Bergen, Sweden, July 11-14, 1990 : Proceedings (Lecture Notes in Computer Science). Springer, 1990.
Erciyes, Kayhan. Complex Networks: An Algorithmic Perspective. Taylor & Francis Group, 2017.
Erciyes, Kayhan. Complex Networks: An Algorithmic Perspective. Taylor & Francis Group, 2014.
Erciyes, Kayhan. Complex Networks: An Algorithmic Perspective. Taylor & Francis Group, 2014.
Erciyes, Kayhan. Complex Networks: An Algorithmic Perspective. Taylor & Francis Group, 2014.