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)
Foundations of Computation, Second Edition
Post date: 28 Oct 2016A free textbook for a one-semester course in theoretical computer science. It has been used for several years in a course at Hobart and William Smith Colleges. The course has no prerequisites other than introductory computer programming.
Publication date: 31 Dec 2011
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported
Document Type: Textbook
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported
Document Type: Textbook
Foundations of Computation, Second Edition
Post date: 28 Oct 2016A free textbook for a one-semester course in theoretical computer science. It has been used for several years in a course at Hobart and William Smith Colleges. The course has no prerequisites other than introductory computer programming.
Publication date: 31 Dec 2011
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported Document Type: Textbook
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported Document Type: Textbook
Introduction to Complexity Theory
Post date: 02 Apr 2007The notes are aimed at exposing the students to the basic results and research directions in the field of Complexity Theory. The focus was on concepts and ideas, and complex technical proofs were avoided.
Publication date: 31 Dec 1999
Introduction to Complexity Theory
Post date: 02 Apr 2007The notes are aimed at exposing the students to the basic results and research directions in the field of Complexity Theory. The focus was on concepts and ideas, and complex technical proofs were avoided.
Publication date: 31 Dec 1999
Introduction to Computational Complexity
Post date: 15 Feb 2007Adopts some unconventional approaches, in which alternating Turing machines are introduced very early, and deterministic and nondeterministic Turing machines treated as special cases, in order to simplify many proofs.
Publication date: 31 Dec 1991
Introduction to Computational Complexity
Post date: 15 Feb 2007Adopts some unconventional approaches, in which alternating Turing machines are introduced very early, and deterministic and nondeterministic Turing machines treated as special cases, in order to simplify many proofs.
Publication date: 31 Dec 1991
Lecture Notes on Algorithm Analysis and Computational Complexity (4th Edition)
Post date: 22 Feb 2005Tranparency materials used in Algorithm Analysis and Complexity Theory course at the University of North Texas.
Publication date: 30 Nov -0001
Lecture Notes on Algorithm Analysis and Computational Complexity (4th Edition)
Post date: 22 Feb 2005Tranparency materials used in Algorithm Analysis and Complexity Theory course at the University of North Texas.
Publication date: 30 Nov -0001
Lecture Notes on Approximation Algorithms
Post date: 25 Feb 2007Attempt to classify all hard optimization problems as one of the possibilities for relaxing the requirements, from the point of view of approximability: easy, intermediate and hard.
Publication date: 31 Dec 1992
Lecture Notes on Approximation Algorithms
Post date: 25 Feb 2007Attempt to classify all hard optimization problems as one of the possibilities for relaxing the requirements, from the point of view of approximability: easy, intermediate and hard.
Publication date: 31 Dec 1992
Models of Computation Exploring the Power of Computing
Post date: 11 May 2016This book re-examines theoretical computer science, offering a fresh approach that gives priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages.
Publisher:
Addison-Wesley Publishing
Publication date: 23 Jul 2008
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 United States
Publication date: 23 Jul 2008
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 United States
Models of Computation Exploring the Power of Computing
Post date: 11 May 2016This book re-examines theoretical computer science, offering a fresh approach that gives priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages.
Publisher:
Addison-Wesley Publishing
Publication date: 23 Jul 2008
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 United States
Publication date: 23 Jul 2008
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 United States
.jpg)
Post date: 22 Feb 2005
The study of resource-bounded aimed at advanced graduate students or researchers in theoretical Computer Science.
The study of resource-bounded aimed at advanced graduate students or researchers in theoretical Computer Science.
Publication date: 01 Jan 1987
Document Type: Book
Document Type: Book
Post date: 22 Feb 2005The study of resource-bounded aimed at advanced graduate students or researchers in theoretical Computer Science.
Publication date: 01 Jan 1987
Document Type: Book
Document Type: Book
The Complexity of Boolean Functions
Post date: 26 Jul 2006Presents a large number of research results on the complexity of Boolean functions in non-uniform computation models. It has a direct relevance to practical problems in the computer aided design of digital circuits.
The Complexity of Boolean Functions
Post date: 26 Jul 2006Presents a large number of research results on the complexity of Boolean functions in non-uniform computation models. It has a direct relevance to practical problems in the computer aided design of digital circuits.
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
429,616
Introduction to Objective Caml
244,675
Notes for the Course of Algorithms
235,425
Lessons In Electric Circuits
208,456
[No longer available] A Beginners C++
162,527
Introduction to Object-Oriented Programming Using C++
160,464
A Short Introduction to Operating Systems
159,805
Data Structures and Algorithms with Object-Oriented Design Patterns in C++
155,617
C Programming Tutorial (K&R version 4)
153,186
Computer Organization and Design Fundamentals
148,127
Programming The Nintendo Game Boy Advance: The Unofficial Guide
Sponsors