Theory of Computation
A branch of computer science that deals with whether and how efficiently problems can be solved on a computer. It is divided into two major sub-branches: computability theory and complexity theory, but both sub-branches deal with formal models of computation.
All categoriesBooks under this sub-category (23 books)
Introduction to Theory of Computation
Post date: 29 Apr 2016A free textbook for an undergraduate course on the Theory of Computation at Carleton University.
Introduction to Theory of Computation
Post date: 29 Apr 2016A free textbook for an undergraduate course on the Theory of Computation at Carleton University.
Publication date: 11 Apr 2016
License: Creative Commons Attribution-ShareAlike 4.0 International
License: Creative Commons Attribution-ShareAlike 4.0 International
Post date: 30 Oct 2004
Methods for solving problems on computers and the costs (usually the running time) of using those methods.
Methods for solving problems on computers and the costs (usually the running time) of using those methods.
Post date: 30 Oct 2004Methods for solving problems on computers and the costs (usually the running time) of using those methods.
Post date: 26 Feb 2007
Introduces the basics of the functional and imperative models of computation, recursive and iterative processes, and the basics of programming using higher-order functions. Uses Standard ML and Java as the programming languages.
Introduces the basics of the functional and imperative models of computation, recursive and iterative processes, and the basics of programming using higher-order functions. Uses Standard ML and Java as the programming languages.
Publication date: 02 Aug 2003
Post date: 26 Feb 2007Introduces the basics of the functional and imperative models of computation, recursive and iterative processes, and the basics of programming using higher-order functions. Uses Standard ML and Java as the programming languages.
Publication date: 02 Aug 2003
An Introduction to the Theory of Computation
Post date: 13 Dec 2006This book explores terminologies and questions concerning programs, computers, problems, and computation. The exploration reduces in many cases to a study of mathematical theories, such as those of automata and formal languages.
An Introduction to the Theory of Computation
Post date: 13 Dec 2006This book explores terminologies and questions concerning programs, computers, problems, and computation. The exploration reduces in many cases to a study of mathematical theories, such as those of automata and formal languages.
Post date: 19 Sep 2007
This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems.
This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems.
Post date: 19 Sep 2007This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems.
Building Blocks for Theoretical Computer Science (Version 1.3)
Post date: 11 May 2016This book teaches you how to read and write mathematical proofs. It also gives a brief introduction to some key topics in theoretical computer science: algorithm analysis and complexity, automata theory, and computability.
Publication date: 01 Jan 2013
Building Blocks for Theoretical Computer Science (Version 1.3)
Post date: 11 May 2016This book teaches you how to read and write mathematical proofs. It also gives a brief introduction to some key topics in theoretical computer science: algorithm analysis and complexity, automata theory, and computability.
Publication date: 01 Jan 2013
Post date: 08 Sep 2005
These lecture notes cover algorithms, especially combinatorial algorithms, with the main goal of creating correct and always-efficient ones.
These lecture notes cover algorithms, especially combinatorial algorithms, with the main goal of creating correct and always-efficient ones.
Publication date: 31 Jan 2015
License: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International
Document Type: Book
License: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International
Document Type: Book
Post date: 08 Sep 2005These lecture notes cover algorithms, especially combinatorial algorithms, with the main goal of creating correct and always-efficient ones.
Publication date: 31 Jan 2015
License: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International Document Type: Book
License: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International Document Type: Book
Combinatorial Optimization: Exact and Approximate Algorithms
Post date: 23 Oct 2016Lecture notes from the class CS261: Optimization and Algorithmic Paradigms taught at Stanford. They cover topics in approximation algorithms, exact optimization, and online algorithms.
Publication date: 11 Mar 2011
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported
Document Type: Lecture Notes
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported
Document Type: Lecture Notes
Combinatorial Optimization: Exact and Approximate Algorithms
Post date: 23 Oct 2016Lecture notes from the class CS261: Optimization and Algorithmic Paradigms taught at Stanford. They cover topics in approximation algorithms, exact optimization, and online algorithms.
Publication date: 11 Mar 2011
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported Document Type: Lecture Notes
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported Document Type: Lecture Notes
Post date: 10 Dec 2006
These notes deal with the foundations of measuring the complexity of a problem, algorithm or structure used in computer science, the traditional branches of mathematics, statistical physics, biology, medicine, social sciences and engineering.
These notes deal with the foundations of measuring the complexity of a problem, algorithm or structure used in computer science, the traditional branches of mathematics, statistical physics, biology, medicine, social sciences and engineering.
Publication date: 31 Dec 1999
Post date: 10 Dec 2006These notes deal with the foundations of measuring the complexity of a problem, algorithm or structure used in computer science, the traditional branches of mathematics, statistical physics, biology, medicine, social sciences and engineering.
Publication date: 31 Dec 1999
Post date: 21 Mar 2007
These set of introductory notes give the broad picture of modern complexity theory, define the basic complexity classes and give some examples of each complexity class.
These set of introductory notes give the broad picture of modern complexity theory, define the basic complexity classes and give some examples of each complexity class.
Publication date: 06 Dec 1999
Post date: 21 Mar 2007These set of introductory notes give the broad picture of modern complexity theory, define the basic complexity classes and give some examples of each complexity class.
Publication date: 06 Dec 1999
Complexity Theory: A Modern Approach
Post date: 21 Oct 2006A draft of a textbook on computational complexity theory. Covers basic complexity classes, lowerbounds for concrete computational models, and some advanced topics.
Complexity Theory: A Modern Approach
Post date: 21 Oct 2006A draft of a textbook on computational complexity theory. Covers basic complexity classes, lowerbounds for concrete computational models, and some advanced topics.
Post date: 21 Mar 2007
These notes deal with the foundations of complexity theory for a one-semester graduate course. Part of it is also suitable for an undergraduate course, at a slower pace. Mathematical maturity is the main prerequisite.
These notes deal with the foundations of complexity theory for a one-semester graduate course. Part of it is also suitable for an undergraduate course, at a slower pace. Mathematical maturity is the main prerequisite.
Publication date: 15 Mar 1994
Document Type: Lecture Notes
Document Type: Lecture Notes
Post date: 21 Mar 2007These notes deal with the foundations of complexity theory for a one-semester graduate course. Part of it is also suitable for an undergraduate course, at a slower pace. Mathematical maturity is the main prerequisite.
Publication date: 15 Mar 1994
Document Type: Lecture Notes
Document Type: Lecture Notes
Computational Complexity: A Conceptual Perspective (Draft)
Post date: 27 Oct 2006Focuses on the high level study of computation, exploring the connections among computational problems and notions. Covers theory of NP-completeness, approximation, probabilistic proof systems, pseudorandomness and cryptography.
Computational Complexity: A Conceptual Perspective (Draft)
Post date: 27 Oct 2006Focuses on the high level study of computation, exploring the connections among computational problems and notions. Covers theory of NP-completeness, approximation, probabilistic proof systems, pseudorandomness and cryptography.
CS 373: Introduction to Theory of Computation
Post date: 20 Oct 2016A collection of class notes used in teaching CS 373 (Theory of Computation), in the Computer Science department in University of Illinois at Urbana-Champaign.
Publication date: 18 May 2009
License: Creative Commons Attribution-NonCommercial 3.0 Unported
Document Type: Lecture Notes
License: Creative Commons Attribution-NonCommercial 3.0 Unported
Document Type: Lecture Notes
CS 373: Introduction to Theory of Computation
Post date: 20 Oct 2016A collection of class notes used in teaching CS 373 (Theory of Computation), in the Computer Science department in University of Illinois at Urbana-Champaign.
Publication date: 18 May 2009
License: Creative Commons Attribution-NonCommercial 3.0 Unported Document Type: Lecture Notes
License: Creative Commons Attribution-NonCommercial 3.0 Unported Document Type: Lecture Notes
Essentials of Theoretical Computer Science
Post date: 30 Sep 2006Covers the basics of the theory of computation and provides some of the tools used in program verification, translation and compiling, and the analysis of algorithms.
Publication date: 31 Dec 1996
Document Type: Textbook
Document Type: Textbook
Essentials of Theoretical Computer Science
Post date: 30 Sep 2006Covers the basics of the theory of computation and provides some of the tools used in program verification, translation and compiling, and the analysis of algorithms.
Publication date: 31 Dec 1996
Document Type: Textbook
Document Type: Textbook
Book Categories
Computer Science
Introduction to Computer Science
Introduction to Computer Programming
Algorithms and Data Structures
Artificial Intelligence
Computer Vision
Machine Learning
Neural Networks
Game Development and Multimedia
Data Communication and Networks
Coding Theory
Computer Security
Information Security
Cryptography
Information Theory
Computer Organization and Architecture
Operating Systems
Image Processing
Parallel Computing
Concurrent Programming
Relational Database
Document-oriented Database
Data Mining
Big Data
Data Science
Digital Libraries
Compiler Design and Construction
Functional Programming
Logic Programming
Object Oriented Programming
Formal Methods
Software Engineering
Agile Software Development
Information Systems
Geographic Information System (GIS)
Mathematics
Mathematics
Algebra
Abstract Algebra
Linear Algebra
Number Theory
Numerical Methods
Precalculus
Calculus
Differential Equations
Category Theory
Proofs
Discrete Mathematics
Theory of Computation
Graph Theory
Real Analysis
Complex Analysis
Probability
Statistics
Game Theory
Queueing Theory
Operations Research
Computer Aided Mathematics
Supporting Fields
Web Design and Development
Mobile App Design and Development
System Administration
Cloud Computing
Electric Circuits
Embedded System
Signal Processing
Integration and Automation
Network Science
Project Management
Operating System
Programming/Scripting
Ada
Assembly
C / C++
Common Lisp
Forth
Java
JavaScript
Lua
Rexx
Microsoft .NET
Perl
PHP
R
Python
Rebol
Ruby
Scheme
Tcl/Tk
Miscellaneous
Most Popular Books
434,363
Introduction to Objective Caml
249,549
Notes for the Course of Algorithms
241,391
Lessons In Electric Circuits
213,277
[No longer available] A Beginners C++
167,119
Introduction to Object-Oriented Programming Using C++
165,706
A Short Introduction to Operating Systems
164,797
Data Structures and Algorithms with Object-Oriented Design Patterns in C++
160,757
C Programming Tutorial (K&R version 4)
158,110
Computer Organization and Design Fundamentals
152,446
Programming The Nintendo Game Boy Advance: The Unofficial Guide
Sponsors