Index of /Books Magazines and other texts/Computer Science/Computability

[ICO]NameSize
[PARENTDIR]Parent Directory -
[ ]Arora S., Barak B. Computational complexity.. A modern approach (CUP, 2009)(ISBN 0521424267)(605s)_CsNp_.pdf3.1M
[ ]Arora S., Barak B. Computational complexity.. A modern approach (web draft, 2007)(489s)_CsNp_.pdf3.5M
[ ]Avigad J. Computability and incompleteness. Lecture notes (free web version, 2007)(128s)_CsNp_.pdf483K
[ ]Barendregt H., Barendsen E. Introduction to Lambda calculus (free web version, 2000)(53s)_CsNp_.pdf251K
[IMG]Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation (Springer, 1997)(ISBN 9780387982816)(600dpi)(T)(474s)_CsNp_.djvu9.8M
[IMG]Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation (Springer, 1997)(ISBN 9780387982816)(T)(474s)_CsNp_.djvu4.7M
[ ]Boerger E., Staerk R. Abstract state machines.. A method for high-level system design and analysis (Springer 2003)(448s).pdf2.7M
[ ]Bogdanov A., Trevisan L. Average-case complexity (NOW, 2006)(ISBN 1933019492)(122s)_CsNp_.pdf584K
[ ]Borger E., Stark R. Abstract state machines.. Solutions to exercises (Springer, 2003)(18s)_CsNp_.pdf253K
[ ]Bovet D., Crescenzi P. Introduction to the theory of complexity (PH, 1994)(ISBN 0139153802)(O)(291s)_CsNp_.pdf1.1M
[IMG]Bridges D.S. Computability.. A mathematical sketchbook (GTM146, Springer, 1994)(ISBN 0387941746)(600dpi)(K)(T)(O)(190s)_CsNp_.djvu1.9M
[IMG]Burgisser, Clausen, Shokrollahi. Algebraic complexity theory (Springer, 1997)(KA)(T)(ISBN 3540605827)(645s)_CsNp_.djvu4.6M
[IMG]Burgisser, Clausen, Shokrollahi. Algebraic complexity theory (Springer, 1997)(L)(T)(ISBN 3540605827)(323s).djvu7.3M
[IMG]Calude C. Information and randomness.. An algorithmic perspective (2ed., Springer, 2002)(ISBN 3540434666)(600dpi)(T)(487s)_CsNp_.djvu3.7M
[IMG]Calude C. Information and randomness.. an algorithmic approach (Springer, 1994)(ISBN 3540574565)(600dpi)(T)(258s)_CsNp_.djvu1.9M
[IMG]Calude C. Theories of computational complexity (ADM35, NH, 1988)(ISBN 044470356X)(T)(498s)_CsNp_.djvu2.1M
[ ]Chazelle B. The discrepancy method. Randomness and complexity (draft, 2001)(O)(497s)_CsNp_.pdf3.0M
[ ]Chiswell I. A course in formal languages, automata and groups (Springer, 2009)(ISBN 1848009399)(161s)_CsNp_.pdf1.1M
[IMG]Clote P., Kranakis E. Boolean functions and computation models (Springer, 2002)(ISBN 3540594361)(T)(O)(618s)_CsNp_.djvu4.3M
[IMG]Codd E.F. Cellular automata (ACM monograph, AP, 1968)(ISBN 0121788504)(KA)(600dpi)(T)(132s)_CsNp_.djvu937K
[ ]Cooper, Lowe, Sorbi. (eds.) New computational paradigms. Changing conceptions of what is computable (Springer, 2008)(ISBN 0387360336)(551s)_CsNp_.pdf4.9M
[ ]Cooper S.B., Sorbi A. (eds.) Computability in context. Computation and logic in the real world (WS, 2009)(ISBN 1848162456)(O)(419s)_CsNp_.pdf2.2M
[IMG]Cooper S.B. Computability theory (CRC, 2004)(ISBN 1584882379)(K)(600dpi)(T)(421s)_CsNp_.djvu3.2M
[IMG]Cowan G., Pines D., Meltzer D. (eds.) Complexity (Perseus Books, 1999)(ISBN 0738202320)(40dpi)(T)(O)(S)(750s)_CsNp_.djvu 10M
[IMG]Cutland N. Computability.. an Introduction to Recursive Function Theory (CUP, 1992)(ISBN 0521223849)(K)(T)(260s)_CsNp_.djvu2.3M
[ ]Dasgupta S., Papadimitriou C.H., Vazirani U.V. Algorithms (web draft, 2006)(ISBN 0073523402)(336s)_CsNp_.pdf1.7M
[IMG]Davis M., Sigal R., Weyuker E. Computability, complexity, and languages.. Fundamentals of theoretical computer science (2ed., AP, 1994)(ISBN 0122063821)(600dpi)(T)(O)(628s)_CsNp_.djvu 0
[IMG]Davis M., Weyuker E. Computability, complexity and languages.. Fundamentals of theoretical computer science (AP, 1983)(ISBN 0122063805)(K)(T)(434s)_CsNp_.djvu2.2M
[IMG]Davis M. Computability and unsolvability (MGH, 1958)(ISBN 0486614719)(T)(235s)_CsNp_.djvu1.7M
[ ]Dowek G. Proofs and algorithms.. An introduction to logic and computability (Springer, 2011)(ISBN 0857291203)(O)(168s)_CsNp_.pdf944K
[ ]Downey R., Hirschfeldt D. Algorithmic randomness and complexity (Springer, 2010)(ISBN 0387955674)(O)(884s)_CsNp_.pdf5.3M
[ ]Du D.Z., Ko K.I., Hu X. Design and analysis of approximation algorithms (Springer, 2012)(ISBN 9781461417002)(O)(450s)_CsNp_.pdf3.1M
[ ]Du D.Z., Ko K.I., Hu X. Design and analysis of approximation algorithms (Springer, 2012)(ISBN 9781461417002)(O)(453s)_CsNp_.pdf2.9M
[IMG]Du Ding-Zhu, Ko Ker-I. Problem solving in automata, languages and complexity (Wiley, 2001)(ISBN 0471439606)(T)(401s).djvu3.4M
[IMG]Eilenberg S., Elgot C. Recursiveness (AP, 1970)(ISBN 0122340507)(600dpi)(T)(94s)_CsNp_.djvu442K
[ ]Enderton H.B. Computability theory. An introduction to recursion theory (AP, 2010)(ISBN 0123849586)(O)(187s)_CsNp_.pdf1.9M
[ ]Enderton H. Computability theory.. An introduction to recursion theory (AP, 2010)(ISBN 0123849586)(O)(176s)_CsNp_.pdf1.8M
[IMG]Epstein R.L., Carnielli W.A. Computability.. computable functions, logic, foundations of mathematics (3ed., Advanced Reasoning Forum, 2008)(ISBN 098155072X)(400dpi)(T)(377s)_CsNp_.djvu 0
[IMG]Epstein R.L., Carnielli W.A. Computability. Computable functions, logic, foundations of mathematics (3ed., ARF, 2008)(ISBN 098155072X)(400dpi)(T)(O)(378s)_CsNp_.djvu 0
[ ]Fernandez M. Models of computation.. An introduction to computability theory (Springer, 2009)(ISBN 1848824335)(188s)_CsNp_.pdf1.0M
[IMG]Feynman et al. Lectures on computation (1996)(T)(ISBN 0201489910)(324s).djvu3.2M
[IMG]Garey M.R., Johnson D.S. Computer and intractability.. a guide to the theory of NP-completeness (1979)(ISBN 0716710447)(600dpi)(T)(O)(351s)_CsNp_.djvu2.9M
[IMG]Garey M.R., Johnson D.S. Computer and intractability.. a guide to the theory of NP-completeness (1979)(L)(T)(ISBN 0716710447)(175s).djvu3.1M
[ ]Goldreich O. Computational complexity.. A conceptual perspective (CUP, 2008)(ISBN 052188473X)(632s)_CsNp_.pdf3.3M
[ ]Goldreich O. Introduction to complexity theory, lecture notes (1999)(375s).pdf2.3M
[ ]Goldreich O. P, NP, and NP-completeness.. The basics of computational complexity (CUP, 2010)(ISBN 052119248X)(O)(216s)_CsNp_.pdf967K
[IMG]Griffor E.R. (ed.) Handbook of computability theory (Elsevier, 1999)(ISBN 0444898824)(T)(710s)_CsNp_.djvu3.5M
[IMG]Griffor E.R. (ed.) Handbook of computability theory (SLFM140, Elsevier, 1999)(ISBN 0444898824)(T)(O)(735s)_CsNp_.djvu4.5M
[ ]Gurari. Introduction to theory of computation (1989)(html).zip3.0M
[ ]Gurari E. Introduction to the theory of computation (1989)(ISBN 0716781824)(600s).pdf6.3M
[IMG]Harel D. Computers Ltd.. What they really can't do (OUP, 2000)(ISBN 0198505558)(600dpi)(T)(O)(238s)_CsNp_.djvu1.7M
[ ]Hehner E.C.R. A practical theory of programming (2ed., 2004)(ISBN 0387941061)(242s).pdf912K
[IMG]Hein J. Theory of Computation. An Introduction (JaBP, 1996)(ISBN 0867204974)(600dpi)(T)(628s)_CsNp_.djvu3.2M
[ ]Homer S., Selman A.L. Computability and complexity theory (2ed., Springer, 2011)(ISBN 9781461406815)(O)(315s)_CsNp_.pdf1.5M
[IMG]Homer S., Selman A.L. Computability and complexity theory (Springer, 2001)(ISBN 0387950559)(T)(207s)_CsNp_.djvu1.3M
[ ]Iordache O. Polystochastic models for complexity (Springer, 2010)(ISBN 3642106536)(O)(310s)_Cs_.pdf1.7M
[ ]Jones N.D. Computability and complexity from a programming perspective (MIT, 1997)(ISBN 0262100649)(O)(484s)_CsNp_.pdf1.7M
[IMG]Jones N.D. Computability and complexity from a programming perspective (MIT, 1997)(ISBN 0262100649)(T)(457s)_CsNp_.djvu3.6M
[IMG]Lewis H.R., Papadimitriou C.H. Elements of the Theory of Computation (2ed., PH, 1998)(ISBN 0132624788)(K)(T)(375s)_CsNp_.djvu2.9M
[ ]Lipton R. The P=NP question and Goedel's lost letter (Springer, 2010)(ISBN 1441971548)(O)(254s)_CsNp_.pdf1.1M
[ ]Luby M., Wigderson A. Pairwise independence and derandomization (NOW, 2006)(ISBN 1933019220)(78s)_CsNp_.pdf465K
[IMG]Mal'cev A.I. Algorithms and recursive functions (Wolters, 1970)(ISBN 9001570704)(K)(T)(O)(370s)_CsNp_.djvu2.1M
[IMG]Manna Z. Lectures on the logic of computer programming (SIAM, 1980)(ISBN 0898711649)(T)(O)(57s)_CsNp_.djvu269K
[IMG]Moret B. The theory of computation (AW, 1998)(ISBN 0201258285)(T)(471s)_CsNp_.djvu3.4M
[ ]Nies A. Computability and randomness (OUP, 2009)(ISBN 0199230765)(450s)_CsNp_.pdf2.3M
[ ]Nies A. Computability and randomness (OUP, 2009)(ISBN 0199230765)(O)(450s)_CsNp_.pdf2.4M
[IMG]O'Donnell M.J. Computing in systems described by equations (LNCS0058, Springer, 1977)(ISBN 0387085319)(T)(125s)_CsNp_.djvu733K
[IMG]Papadimitriou C.H. Computational Complexity (1994)(600dpi)(T)(540s)_CsNp_.djvu4.5M
[IMG]Parberry I. Complexity of parallel computations (free web version, 1987)(ISBN 0470209313)(T)(O)(212s)_CsNp_.djvu1.4M
[IMG]Peter R. Recursive functions (2ed., AP, 1967)(ASIN B0006BP0OE)(T)(301s)_CsNp_.djvu1.8M
[IMG]Salomaa A. Computation and automata (CUP 1985)(T)(ISBN 0521302455)(290s).djvu3.1M
[IMG]Schoening U. Algorithmen kurz gefasst (Spectrum, 1997)(ISBN 3827402328)(de)(T)(209s)_CsNp_.djvu1.3M
[IMG]Schoening U. Theoretische Informatik kurz gefasst (Inf IV)(low res)(de)(T)(86s).djvu1.6M
[ ]Schoning U. Gems of theoretical computer science (draft, Springer, 1998)(ISBN 3540644253)(327s)_CsNp_.pdf1.3M
[ ]Singh A. Elements of computation theory (Springer, 2009)(ISBN 1848824963)(429s)_CsNp_.pdf3.1M
[IMG]Sipser M. Introduction to the theory of computation (2005)(600dpi)(T)(ISBN 0534950973)(453s)_CsNp_.djvu5.0M
[IMG]Sipser M. Introduction to the theory of computation (PWS, 1997)(ISBN 053494728X)(K)(T)(410s)_CsNp_.djvu3.5M
[IMG]Sipser M. Introduction to the theory of computation. Instructor's manual.. solutions to 1ed., 1997 (Thomson, 1999)(ISBN 053437462X)(600dpi)(K)(T)(O)(61s)_CsNp_.djvu 0
[IMG]Smith C. A recursive introduction to the theory of computation (Springer, 1994)(ISBN 0387943323)(600dpi)(T)(O)(155s)_CsNp_.djvu1.1M
[IMG]Straubing H. Finite automata, formal logic, and circuit complexity (Birkhauser, 1994)(600dpi)(T)(ISBN 0817637192)(237s).djvu 11M
[IMG]Streicher T. Domain-theoretic foundations of functional programming (WS, 2006)(ISBN 9812701427)(T)(C)(O)(132s)_CsNp_.djvu856K
[IMG]Sudan M. Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems (LNCS1001, Springer, 1995)(ISBN 3540606157)(T)(O)(98s)_CsNp_.djvu 0
[ ]Turner R. Computable Models (Springer, 2009)(ISBN 1848820518)(238s)_CsNp_.pdf1.0M
[IMG]Wegener I. Branching programs and binary decision diagrams (SIAM, 2000)(ISBN 0898714583)(T)(O)(419s)_CsNp_.djvu3.4M
[ ]Yap C.K. Theory of complexity classes (web draft, 2009)(O)(438s)_CsNp_.pdf4.8M
[ ]Yap C.K. Theory of complexity classes. Vol.1 (free draft, 1998)(O)(435s)_CsNp_.pdf1.9M
[ ]Zenil H. (ed.) Randomness through computation. Some answers, more questions (WS, 2011)(ISBN 9814327743)(O)(440s)_CsNp_.pdf2.4M
[IMG]Zhou C., Hansen M.R. Duration Calculus.. A Formal Approach to Real-Time Systems (Springer, 2004)(ISBN 3540408231)(600dpi)(T)(256s)_CsNp_.djvu1.8M
[IMG]Zimand M. Computational complexity. A quantitative perspective (Elsevier, 2004)(ISBN 0444828419)(T)(350s)_CsNp_.djvu1.9M
Apache/2.4.58 (Ubuntu) Server at filelake.xyz Port 443