Add resource "NTIN090 - Introduction to Complexity and Computability" Accepted
Changes: 10
-
Add Computational Complexity: A Modern Approach / Sanjeev Arora and Boaz Barak
- Title
-
- Unchanged
- Computational Complexity: A Modern Approach / Sanjeev Arora and Boaz Barak
- Type
-
- Unchanged
- Book
- Created
-
- Unchanged
- 2009-04-20
- Description
-
- Unchanged
- This is a textbook on computational complexity theory. It is intended as a text for an advanced undergraduate course or introductory graduate course, or as a reference for researchers and students in computer science and allied fields such as mathematics and physics.
- Link
-
- Unchanged
- https://theory.cs.princeton.edu/complexity/
- Identifier
-
- Unchanged
- 978-0521424264
Resource | v1 | current (v1) -
Add Introduction to the Theory of Computation, 3rd edition
- Title
-
- Unchanged
- Introduction to the Theory of Computation, 3rd edition
- Type
-
- Unchanged
- Book
- Created
-
- Unchanged
- 2012-06-27
- Description
-
- Unchanged
- Gain a clear understanding of even the most complex, highly theoretical computational theory topics in the approachable presentation found only in the market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today's computational theory course, this revision continues the book's well-know, approachable style with timely revisions, additional practice, and more memorable examples in key areas. A new first-of-its-kind theoretical treatment of deterministic context-free languages is ideal for a better understanding of parsing and LR(k) grammars. You gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. INTRODUCTION TO THE THEORY OF COMPUTATION, 3E's comprehensive coverage makes this a valuable reference for your continued studies in theoretical computing.
- Link
-
- Unchanged
- https://www.amazon.com/Introduction-Theory-Computation-Michael-Sipser/dp/113318779X
- Identifier
-
- Unchanged
- 978-1133187790
Resource | v1 | current (v1) -
Add Introduction to Complexity and Computability
- Title
-
- Unchanged
- Introduction to Complexity and Computability
- Type
-
- Unchanged
- Course
- Created
-
- Unchanged
- no value
- Description
-
- Unchanged
- This is a basic course on the theory of algorithms, computability and computational complexity. Roughly the first half of the course is devoted to the introduction to computability theory: Turing machines. Computable functions. Recursive and recursively enumerable languages and sets. Undecidable problems. The second half of the course is devoted to the study of space and time complexity classes: Equivalence of PSPACE and NPSPACE. Deterministic hierarchy theorems. Class NP. Polynomial reducibility among problems. Proofs of NP- completeness. Approximation algorithms and approximation schemes.
- Link
-
- Unchanged
- http://ktiml.mff.cuni.cz/~kucerap/NTIN090/index-en.html
- Identifier
-
- Unchanged
- no value
Resource | v1 | current (v1) -
Add Theory of computation
- Title
-
- Unchanged
- Theory of computation
- Description
-
- Unchanged
- In theoretical computer science and mathematics, the theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question: "What are the fundamental capabilities and limitations of computers?". In order to perform a rigorous study of computation, computer scientists work with a mathematical abstraction of computers called a model of computation. There are several models in use, but the most commonly examined is the Turing machine. Computer scientists study the Turing machine because it is simple to formulate, can be analyzed and used to prove results, and because it represents what many consider the most powerful possible "reasonable" model of computation (see Church–Turing thesis).
- Link
-
- Unchanged
- https://en.wikipedia.org/?curid=30402
Topic | v1 | current (v1) -
Add Theory of computation treated in Introduction to Complexity and Computability
- Current
- treated in
Topic to resource relation | v1 -
Add Theory of computation treated in Computational Complexity: A Modern Approach / Sanjeev Arora and Boaz Barak
- Current
- treated in
Topic to resource relation | v1 -
Add Theory of computation treated in Introduction to the Theory of Computation, 3rd edition
- Current
- treated in
Topic to resource relation | v1 -
Add Computer science parent of Theory of computation
- Current
- parent of
Topic to topic relation | v1 -
Add Introduction to Complexity and Computability follows Computational Complexity: A Modern Approach / Sanjeev Arora and Boaz Barak
- Current
- follows
Resource to resource relation | v1 -
Add Introduction to Complexity and Computability follows Introduction to the Theory of Computation, 3rd edition
- Current
- follows
Resource to resource relation | v1