Welcome to the “World Lending Library”

[ICO]NameSize
[DIR]Parent Directory -
[PDF]Arora S., Barak B. Computational complexity.. A modern approach (CUP, 2009)(ISBN 0521424267)(605s)_CsNp_.pdf3.1M
[PDF]Arora S., Barak B. Computational complexity.. A modern approach (web draft, 2007)(489s)_CsNp_.pdf3.5M
[PDF]Avigad J. Computability and incompleteness. Lecture notes (free web version, 2007)(128s)_CsNp_.pdf483K
[PDF]Barendregt H., Barendsen E. Introduction to Lambda calculus (free web version, 2000)(53s)_CsNp_.pdf251K
[PDF]Bogdanov A., Trevisan L. Average-case complexity (NOW, 2006)(ISBN 1933019492)(122s)_CsNp_.pdf584K
[PDF]Borger E., Stark R. Abstract state machines.. Solutions to exercises (Springer, 2003)(18s)_CsNp_.pdf253K
[PDF]Bovet D., Crescenzi P. Introduction to the theory of complexity (PH, 1994)(ISBN 0139153802)(O)(291s)_CsNp_.pdf1.1M
[IMG]Burgisser, Clausen, Shokrollahi. Algebraic complexity theory (Springer, 1997)(L)(T)(ISBN 3540605827)(323s).djvu7.3M
[IMG]Calude C. Theories of computational complexity (ADM35, NH, 1988)(ISBN 044470356X)(T)(498s)_CsNp_.djvu2.1M
[PDF]Chazelle B. The discrepancy method. Randomness and complexity (draft, 2001)(O)(497s)_CsNp_.pdf3.0M
[PDF]Chiswell I. A course in formal languages, automata and groups (Springer, 2009)(ISBN 1848009399)(161s)_CsNp_.pdf1.1M
[IMG]Codd E.F. Cellular automata (ACM monograph, AP, 1968)(ISBN 0121788504)(KA)(600dpi)(T)(132s)_CsNp_.djvu937K
[IMG]Cooper S.B. Computability theory (CRC, 2004)(ISBN 1584882379)(K)(600dpi)(T)(421s)_CsNp_.djvu3.2M
[PDF]Dasgupta S., Papadimitriou C.H., Vazirani U.V. Algorithms (web draft, 2006)(ISBN 0073523402)(336s)_CsNp_.pdf1.7M
[IMG]Davis M. Computability and unsolvability (MGH, 1958)(ISBN 0486614719)(T)(235s)_CsNp_.djvu1.7M
[PDF]Downey R., Hirschfeldt D. Algorithmic randomness and complexity (Springer, 2010)(ISBN 0387955674)(O)(884s)_CsNp_.pdf5.3M
[IMG]Eilenberg S., Elgot C. Recursiveness (AP, 1970)(ISBN 0122340507)(600dpi)(T)(94s)_CsNp_.djvu442K
[PDF]Enderton H. Computability theory.. An introduction to recursion theory (AP, 2010)(ISBN 0123849586)(O)(176s)_CsNp_.pdf1.8M
[IMG]Feynman et al. Lectures on computation (1996)(T)(ISBN 0201489910)(324s).djvu3.2M
[PDF]Goldreich O. Computational complexity.. A conceptual perspective (CUP, 2008)(ISBN 052188473X)(632s)_CsNp_.pdf3.3M
[PDF]Goldreich O. Introduction to complexity theory, lecture notes (1999)(375s).pdf2.3M
[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
[PDF]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
[PDF]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
[IMG]Homer S., Selman A.L. Computability and complexity theory (Springer, 2001)(ISBN 0387950559)(T)(207s)_CsNp_.djvu1.3M
[PDF]Iordache O. Polystochastic models for complexity (Springer, 2010)(ISBN 3642106536)(O)(310s)_Cs_.pdf1.7M
[PDF]Lipton R. The P=NP question and Goedel's lost letter (Springer, 2010)(ISBN 1441971548)(O)(254s)_CsNp_.pdf1.1M
[PDF]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
[PDF]Nies A. Computability and randomness (OUP, 2009)(ISBN 0199230765)(450s)_CsNp_.pdf2.3M
[PDF]Nies A. Computability and randomness (OUP, 2009)(ISBN 0199230765)(O)(450s)_CsNp_.pdf2.4M
[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
[PDF]Schoning U. Gems of theoretical computer science (draft, Springer, 1998)(ISBN 3540644253)(327s)_CsNp_.pdf1.3M
[PDF]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
[PDF]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
[PDF]Yap C.K. Theory of complexity classes (web draft, 2009)(O)(438s)_CsNp_.pdf4.8M
[PDF]Yap C.K. Theory of complexity classes. Vol.1 (free draft, 1998)(O)(435s)_CsNp_.pdf1.9M
[IMG]Zimand M. Computational complexity. A quantitative perspective (Elsevier, 2004)(ISBN 0444828419)(T)(350s)_CsNp_.djvu1.9M