Книги з теми "Computational complexity and computability"

Börger, E. Computability, complexity, logic. Amsterdam: North-Holland, 1989.

Nies, André. Computability and randomness. Oxford: Oxford University Press, 2012.

Computability and randomness. New York: Oxford University Press, 2009.

Jones, Neil D. Computability and complexity: From a programming perspective. Cambridge, Mass: MIT Press, 1997.

Rich, Elaine. Automata, computability and complexity: Theory and applications. Upper Saddle River, N.J: Pearson Prentice Hall, 2008.

Ron, Sigal, and Weyuker Elaine J, eds. Computability, complexity, and languages: Fundamentals of theoretical computer science. 2nd ed. Boston: Academic Press, Harcourt, Brace, 1994.

Petzold, Charles. The annotated Turing: A guided tour through Alan Turing's historic paper on computability. Indianapolis, IN: Wiley Pub., 2008.

1966-, Blanck Jens, Brattka Vasco 1966-, and Hertling Peter 1965-, eds. Computability and complexity in analysis: 4th international workshop, CCA 2000, Swansea, UK, September 17-19, 2000 : selected papers. Berlin: Springer, 2001.

1952-, Calude Cristian, Dinneen M. J. 1957-, and Sburlan Silviu, eds. Combinatorics, computability, and logic: Proceedings of the Third International Conference on Combinatorics, Computability, and Logic, (DMTCS '01). London: Springer, 2001.

A first course in logic: An introduction to model theory, proof theory, computability, and complexity. Oxford: Oxford University Press, 2004.

Sommerhalder, R. The theory of computability: Programs, machines, effectiveness and feasibility. Wokingham: Addison-Wesley, 1988.

Sommerhalder, R. The theory of computability: Programs, machines, effectiveness, and feasibility. Wokingham, England: Addison-Wesley Pub. Co., 1988.

M, Cohen Arjeh, Cohen Henri, Eisenbud David, Singer Michael F. 1950-, Sturmfels Bernd 1962-, Yampolsky Michael 1972-, and SpringerLink (Online service), eds. Computability of Julia Sets. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.

Löwe, Benedikt. Models of Computation in Context: 7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011. Proceedings. Berlin, Heidelberg: Springer-Verlag GmbH Berlin Heidelberg, 2011.

Conference on Computability in Europe (6th 2010 Ponta Delgada, Azores, Portugal). Programs, proofs, processes: 6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30-July 4, 2010 ; proceedings. Berlin: Springer, 2010.

Spain) UIMP-RSME Lluis Santaló Summer (2012 Santander. Recent advances in real complexity and computation: UIMP-RSME Lluis A. Santaló Summer School, Recent advances in real complexity and computation, July 16-20, 2012, Universidad Internacional Menéndez Pelayo, Santander, Spain. Edited by Montaña, Jose Luis, 1961- editor of compilation and Pardo, L. M. (Luis M.), editor of compilation. Providence, Rhode Island: American Mathematical Society, 2013.

Anuj, Dawar, Löwe Benedikt, and SpringerLink (Online service), eds. How the World Computes: Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Bonizzoni, Paola. The Nature of Computation. Logic, Algorithms, Applications: 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Day, Adam, Michael Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander Melnikov, and Frances Rosamond, eds. Computability and Complexity. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-50062-1.

Homer, Steven, and Alan L. Selman. Computability and Complexity Theory. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4614-0682-2.

Homer, Steven, and Alan L. Selman. Computability and Complexity Theory. New York, NY: Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4757-3544-4.

Blanck, Jens, Vasco Brattka, and Peter Hertling, eds. Computability and Complexity in Analysis. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45335-0.

Computational complexity. Reading, Mass: Addison-Wesley, 1994.

Gerd, Wechsung, ed. Computational complexity. Dordrecht: Reidel Pub. Co., 1986.

Gasarch, William I. Bounded queries in recursion theory. Boston: Birkauser, 1999.

Watanabe, Osamu, ed. Kolmogorov Complexity and Computational Complexity. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-77735-6.

1958-, Watanabe Osamu, ed. Kolmogorov complexity and computational complexity. Berlin: Springer-Verlag, 1992.

Watanabe, Osamu. Kolmogorov Complexity and Computational Complexity. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992.

Hartmanis, Juris, ed. Computational Complexity Theory. Providence, Rhode Island: American Mathematical Society, 1989. http://dx.doi.org/10.1090/psapm/038.

Steven, Rudich, and Wigderson Avi, eds. Computational complexity theory. [Providence, R.I.]: American Mathematical Society, Institute for Advanced Study, 2004.

Erich, Kaltofen, ed. Computational algebraic complexity. London: Academic Press, 1990.

Calude, Cristian. Theoriesof computational complexity. [Amsterdam]: North-Holland, 1988.

Brattka, Vasco, and Peter Hertling, eds. Handbook of Computability and Complexity in Analysis. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-59234-9.

1947-, Velupillai Kumaraswamy, ed. Computability, complexity and constructivity in economic analysis. Oxford: Blackwell Pub., 2005.

Leivant, Daniel, ed. Logic and Computational Complexity. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60178-3.

Agrawal, Manindra, and Vikraman Arvind, eds. Perspectives in Computational Complexity. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-05446-9.

Du, Ding-Zhu, and Ker-I. Ko. Theory of Computational Complexity. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2000. http://dx.doi.org/10.1002/9781118032916.

Du, Ding-Zhu, and Ker-I. Ko. Theory of Computational Complexity. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2014. http://dx.doi.org/10.1002/9781118595091.

Theories of computational complexity. Amsterdam: North-Holland, 1988.

Balcázar, José Luis. Structural complexity. Berlin: Springer-Verlag, 1988.

Complexity explained. Berlin: Springer, 2008.

Homer, Steven, and Alan L. Selman. Computability and Complexity Theory. Springer, 2011.

Homer, Steven, and Alan L. Selman. Computability and Complexity Theory. Springer New York, 2013.

Homer, Steven, and Alan L. Selman. Computability and Complexity Theory. Springer, 2014.

Homer, Steven, and Alan L. Selman. Computability and Complexity Theory. Springer, 2011.

(Editor), Jens Blanck, Vasco Brattka (Editor), and Peter Hertling (Editor), eds. Computability & Complexity in Analysis. Springer, 2001.

Computability And Complexity Theory. Springer, 2011.

Nies, André. Computability and Randomness. Oxford University Press, Incorporated, 2009.

Computability: Turing, Gödel, Church, and Beyond. The MIT Press, 2015.

Computability: Turing, Gödel, Church, and Beyond. The MIT Press, 2013.