Książki na temat „Réduction de la complexité de calcul”

Wilf, Herbert S. Algorithmes et complexité. Paris: Masson, 1989.

Luhmann, Niklas. La confiance: Un mécanisme de réduction de la complexité sociale. Paris: Economica, 2006.

L, Selman Alan, red. 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.

Complexity and postmodernism: Understanding complex systems. London: Routledge, 1998.

International Meeting of Young Computer Scientists (5th 1988 Smolenice, Slovakia). Machines, languages, and complexity. Berlin: Springer-Verlag, 1989.

R, Carson Ewart, red. Dealing with complexity: An introduction to the theory and application of systems science. New York: Plenum Press, 1988.

Flood, Robert L. Dealingwith complexity: An introduction to the theory and application of systems science. New York: Plenum, 1988.

Flood, Robert L. Dealing with complexity: An introduction to the theory and application of systems science. Wyd. 2. New York: Plenum Press, 1993.

Kearns, Michael J. The computational complexity of machine learning. Cambridge, Mass: MIT Press, 1990.

Xuong, Nguyen Huy. Mathématiques discrètes et informatique. Paris: Masson, 1992.

Raphaël, Leivant Daniel Maurice, red. Logic and computational complexity: International workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers. Berlin: Springer, 1995.

Arto, Salomaa, Karhumäki J, Maurer Hermann A. 1941- i Rozenberg Grzegorz, red. Results and trends in theoretical computer science: Colloquium in honor of Arto Salomaa, Graz, Austria, June 10-11, 1994 : proceedings. Berlin: Springer-Verlag, 1994.

1956-, Sorbi Andrea, red. Complexity, logic, and recursion theory. New York: Marcel Dekker, 1997.

Chaos & complexity: Discovering the surprising patterns of science and technology. Weinheim: VCH, 1993.

Kaye, Brian H. Chaos & complexity: Discovering the surprising patterns of science and technology. Weinheim: VCH Verlagsgesellschaft, 1993.

Kaye, Brian H. Chaos & complexity: Discovering the surprising patterns of science and technology. New York: Weinheim, 1993.

1946-, Woźniakowski Henryk, i European Mathematical Society, red. Essays on the complexity of continuous problems. Zürich, Switzerland: European Mathematical Society, 2009.

Complexity theory and cryptology: An introduction to cryptocomplexity. Berlin: Springer, 2005.

C, Berwick Robert, i Ristad Eric Sven, red. Computational complexity and natural language. Cambridge, Mass: MIT Press, 1987.

Meinel, Christoph. Modified branching programs and their computational power. Berlin: Springer-Verlag, 1989.

ACM 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. New York: Association for Computing Machinery, 2002.

Number theoretic methods in cryptography: Complexity lower bounds. Basel: Birkhäuser, 1999.

1955-, Djidjev H., Bŭlgarska akademii͡a︡ na naukite. Center of Informatics and Computer Technology. i International Symposium on Optimal Algorithms (2nd : 1989 : Varna, Bulgaria), red. Optimal algorithms: International symposium, Varna, Bulgaria, May 29-June 2 1989 proceedings. Berlin: Springer-Verlag, 1989.

1951-, Zurek Wojciech Hubert, red. 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. Redwood City, Calif: Addison-Wesley Pub. Co., 1990.

Wilf, Herbert S. Algorithms and complexity. Englewood Cliffs, N.J: Prentice-Hall, 1986.

Algorithms and complexity. Wyd. 2. Natick, Mass: A.K. Peters, 2002.

1946-, Börger E., red. Computation theory and logic. Berlin: Springer-Verlag, 1987.

A new kind of science. Champaign, IL: Wolfram Media, 2002.

Wolfram, Stephen. A New Kind of Science. Champaign, IL: Wolfram Media, 2002.

Wolfram, Stephen. A New Kind of Science. Champaign, IL: Wolfram Media, 2002.

Rajeev, Motwani, i Ullman Jeffrey D. 1942-, red. Introduction to automata theory, languages, and computation. Wyd. 2. Boston: Addison-Wesley, 2001.

Motwani, Rajeev. Introduction to automata theory, languages, and computation. USA: Pearson/Addison-Wesley, 2007.

1967-, Pentus Mati Reĭnovich, i Vereshchagin Nikolai Konstantinovich 1958-, red. Provability, complexity, grammars. Providence, RI: American Mathematical Society, 1999.

Dingzhu, Du, Duan Zhenhua, Li Angsheng i SpringerLink (Online service), red. Theory and Applications of Models of Computation: 5th International Conference, TAMC 2008, Xi’an, China, April 25-29, 2008. Proceedings. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2008.

H, Papadimitriou Christos, red. Elements of the theory of computation. Wyd. 2. London: Prentice Hall International, 1998.

H, Papadimitriou Christos, red. Elements of the theory of computation. Wyd. 2. Upper Saddle River, N.J: Prentice-Hall, 1998.

Colloquium 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. Berlin: Springer-Verlag, 1988.

Understanding information and computation: From Einstein to Web science. Farnham, Surrey, England: Gower Pub., 2011.

Hromkovič, Juraj. Algorithmics for hard problems: Introduction to combinatorial optimization, randomization, approximation, and heuristics, with 71 figures. Wyd. 2. Berlin: Springer-Verlag, 2004.

Algorithmics for hard problems: Introduction to combinatorial optimization, randomization, approximation, and heuristics. Wyd. 2. Berlin: Springer-Verlag, 2003.

Algorithmics for hard problems: Introduction to combinatorial optimization, randomization, approximation, and heuristics. Berlin: Springer, 2001.

Computational vision. Boston: Academic Press, 1990.

Thomas, Schiex, red. Intelligence artificielle et informatique théorique. Toulouse: Cépaduès-éd., 1994.

Neural network design and the complexity of learning. Cambridge, Mass: MIT Press, 1990.

Schöning, Uwe. Complexity and Structure. Springer, 1986.

Acm Special Interest Group On Algorithms. Stoc 96: 28th ACM Symposium on the Theory of Computing. Association for Computing Machinery (ACM), 1996.

(Editor), Lars Arge, i Rusins Freivalds (Editor), red. 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, i Rusins Freivalds. Algorithm Theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings. Springer London, Limited, 2006.