Books on the topic 'Réduction de la complexité de calcul'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 books for your research on the topic 'Réduction de la complexité de calcul.'
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.
Luhmann, Niklas. La confiance: Un mécanisme de réduction de la complexité sociale. Economica, 2006.
Find full textScandinavian 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. Springer, 2000.
Find full textScandinavian 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. Springer, 2000.
Find full textInternational Meeting of Young Computer Scientists (5th 1988 Smolenice, Slovakia). Machines, languages, and complexity. Springer-Verlag, 1989.
Find full textFlood, Robert L. Dealingwith complexity: An introduction to the theory and application of systems science. Plenum, 1988.
Find full textFlood, Robert L. Dealing with complexity: An introduction to the theory and application of systems science. 2nd ed. Plenum Press, 1993.
Find full textKearns, Michael J. The computational complexity of machine learning. MIT Press, 1990.
Find full text1956-, Sorbi Andrea, ed. Complexity, logic, and recursion theory. Marcel Dekker, 1997.
Find full textArto, Salomaa, Karhumäki J, Maurer Hermann A. 1941-, and Rozenberg Grzegorz, eds. Results and trends in theoretical computer science: Colloquium in honor of Arto Salomaa, Graz, Austria, June 10-11, 1994 : proceedings. Springer-Verlag, 1994.
Find full textKaye, Brian H. Chaos & complexity: Discovering the surprising patterns of science and technology. VCH Verlagsgesellschaft, 1993.
Find full textKaye, Brian H. Chaos & complexity: Discovering the surprising patterns of science and technology. Weinheim, 1993.
Find full text1946-, Woźniakowski Henryk, and European Mathematical Society, eds. Essays on the complexity of continuous problems. European Mathematical Society, 2009.
Find full textMeinel, Christoph. Modified branching programs and their computational power. Springer-Verlag, 1989.
Find full textACM Symposium on Theory of Computing (34th 2002 Montréal, Québec). Proceedings of the 34th Annual ACM Symposium on the Theory of Computing: Montreal, Quebec, Canada, May 19-21, 2002. Association for Computing Machinery, 2002.
Find full textC, Berwick Robert, and Ristad Eric Sven, eds. Computational complexity and natural language. MIT Press, 1987.
Find full text1951-, Zurek Wojciech Hubert, ed. Complexity, entropy, and the physics of information: The proceedings of the 1988 Workshop on Complexity, Entropy, and the Physics of Information held May-June, 1989, in Santa Fe, New Mexico. Addison-Wesley Pub. Co., 1990.
Find full textAntoine, Lobstein, and Cohen Gerard, eds. Algorithmic complexityand communication problems. UCL Press, 1996.
Find full textKumarss, Naimipour, ed. Foundations of algorithms: Using C plus plus pseudocode. 2nd ed. Jones and Bartlett Publishers, 1998.
Find full textColloquium on Trees in Algebra and Programming (13th 1988 Nancy, France). CAAP '88: 13th Colloquium on Trees in Algebra and Programming, Nancy, France, March 21-24, 1988 : proceedings. Springer-Verlag, 1988.
Find full textH, Papadimitriou Christos, ed. Elements of the theory of computation. 2nd ed. Prentice Hall International, 1998.
Find full textH, Papadimitriou Christos, ed. Elements of the theory of computation. 2nd ed. Prentice-Hall, 1998.
Find full textHromkovič, Juraj. Algorithmics for hard problems: Introduction to combinatorial optimization, randomization, approximation, and heuristics, with 71 figures. 2nd ed. Springer-Verlag, 2004.
Find full textMotwani, Rajeev. Introduction to automata theory, languages, and computation. Pearson/Addison-Wesley, 2007.
Find full textRajeev, Motwani, and Ullman Jeffrey D. 1942-, eds. Introduction to automata theory, languages, and computation. 2nd ed. Addison-Wesley, 2001.
Find full textAcm Special Interest Group On Algorithms. Stoc 96: 28th ACM Symposium on the Theory of Computing. Association for Computing Machinery (ACM), 1996.
Find full textArge, 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.
Find full textCellular automata and complexity: Collected papers. Addison-Wesley Pub. Co., 1994.
Find full textDiaz, Josep, Joaquim Gabarro, and Jose L. Balcazar. Structural Complexity II (Monographs in Theoretical Computer Science. An EATCS Series). Springer, 1990.
Find full textA Guide To Algorithm Design Paradigms Methods And Complexity Analysis. CRC Press, 2013.
Find full textGroote, H. F. De. Lectures on the Complexity of Bilinear Problems. Springer, 1987.
Find full textMiklos, Istvan. Computational Complexity of Counting and Sampling. Taylor & Francis Group, 2019.
Find full textMiklos, Istvan. Computational Complexity of Counting and Sampling. Taylor & Francis Group, 2019.
Find full textComplexity theory and cryptology: An introduction to cryptocomplexity. Springer, 2005.
Find full text(Editor), Juliani Karhumdki, Hermann Maurer (Editor), and Grzegorz Rozenberg (Editor), eds. Results and Trends in Theoretical Computer Science: Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10 - 11, 1994. Proceedings (Lecture Notes in Computer Science). Springer, 1994.
Find full textMaurer, H., and J. Karhumaki. Results and Trends in Theoretical Computer Science: Colloquium in Honor of Arto Salomaa Graz, Austria, June 10-11, 1994 : Proceedings (Lecture Notes in Computer Science). Springer, 1994.
Find full textBarton, G. Edward, Robert C. Berwick, and Eric Sven Ristad. Computational Complexity and Natural Language. MIT Press, 1987.
Find full textJones, Gordon R., and Joseph W. Spencer. Advanced Chromatic Monitoring. Taylor & Francis Group, 2020.
Find full textJones, G. R., and Joseph W. Spencer. Advanced Chromatic Monitoring. Taylor & Francis Group, 2022.
Find full text